Skip to content
sahil.science
Questions
Papers
Topics
Syntheses
Almanac
About
C⁶
2026
← Questions
Source-derived question
What is the Boolean satisfiability problem, and why is it considered NP-complete?
Computational Complexity Theory
Sources that address it
ACM A.M. Turing Award
almanac
Related questions
How can a nondeterministic finite automaton be converted into a deterministic one without losing expressive power?
How did Cook's proof show that many seemingly unrelated hard computational problems were secretly versions of the same problem?
How did Manuel Blum help define what it means for an encryption scheme to be secure?
How did Rabin and Scott's result seed later work on regular expressions and the P versus NP problem?
How did the classification of a problem as NP-complete change how computer scientists approach solving it?
How do Yao's circuit complexity results limit restricted models of computation?
How does Karp's result relate to the still-unsolved P versus NP problem?
How does PAC learning define when a system can be said to have learned something?