Abstract
This work has been accepted for publication. Full text will be available at this URL when published.
Status: This work is forthcoming. Full text will be available upon publication.
For inquiries: contact@uvsmpublications.com
Verification
SHA-256: a63ff72216d583079531e4b2d7824851d4e01174623f18689b7063d76ab4829b
Date: June 20, 2026
To verify: download the source file and run sha256sum on it. A matching hash confirms the file is identical to the version registered on the date above.
@misc{LandryForrest2026,
title = {The Natural Basis of Computational Complexity Theory},
author = {Landry, Forrest},
year = {2026},
doi = {10.67291/ELPQ9800},
url = {https://doi.org/10.67291/ELPQ9800},
isbn = {979-8-951203-33-5},
publisher = {UVSM Publications LLC},
abstract = {This work has been accepted for publication. Full text will be available at this URL when published.},
}
TY - RPRT
TI - The Natural Basis of Computational Complexity Theory
AU - Landry, Forrest
PY - 2026
PB - UVSM Publications LLC
DO - 10.67291/ELPQ9800
UR - https://doi.org/10.67291/ELPQ9800
SN - 979-8-951203-33-5
AB - This work has been accepted for publication. Full text will be available at this URL when published.
ER -