arXiv (All)
open access
P is not equal to NP
In this paper, we prove that P is not equal to NP. The proof is based on the Boolean Satisfiability problem(SAT). For any algorithm to solve SAT instances, we prove that there is an exponential lower bound in computation complexity, so that we have P is not equal to NP.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Advanced Complexity Theory#3433
- On the NP-Hardness of Unconstrained Static Output Feedback Stabilization#1143329
- Constructive solvability and the P versus NP problem#617761
- Constructive solvability and the P versus NP problem#617261
- Historical quotes on the promise and value of an NPS education#497101
Record · ID 1076676
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive