On the complexity of SAT
Abstract
In this paper, we prove that no deterministic algorithm can solve SAT in polynomial time in the number of boolean variables.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.