Example image of eyePlorer eyePlorer map for 'Boolean satisfiability problem': Boolean logic Computational complexity theory Decision problem Propositional calculus Truth value Variable (mathematics) NP-complete Algorithm Artificial intelligence Computer science CPU design Electronic design automation Formal verification Propositional formula Theoretical computer science De Morgan's laws Logical disjunction Conjunction Conjunctive normal form 2-satisfiability NL-complete Horn clause Horn-satisfiability P-complete Cook–Levin theorem Automatic test pattern generation Field-programmable gate array Formal equivalence checking Microprocessor Model checking Routing (electronic design automation) Stephen Cook Disjunctive normal form NL (complexity) Exclusive or L (complexity) SL (complexity) P (complexity) P versus NP problem Karp's 21 NP-complete problems Clique problem One-in-three 3SAT Implication Unit propagation Satisfiability Modulo Theories Quantification Second-order propositional logic Co-NP-complete Tautology (logic) PSPACE-complete
Disclaimer