Finite Automata don't Solve NP-Complete Problems
<p>We are giving the full proof towards Cook’s “P versus NP” theorem and our functional conjecture.</p>
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2025-01-01
- DOI
- https://doi.org/10.13140/rg.2.2.24308.46720
- Primary Topic
- Wheat and Barley Genetics and Pathology
- Type
- article
- Field-Weighted Citation Impact
- 0.00