3sat (187B)
1 # 3SAT 2 3 The [Boolean_satisfiability] problem on [3CNF] formulas 4 5 It is [np_complete] 6 7 [3sat_variants] 8 9 Up: [sat_variants] 10 11 See also: [2sat], [schaefers_dichotomy_theorem] 12 13 Aliases: 3 SAT
![]() | wiki_researchpersonal research wiki |
git clone https://a3nm.net/git/wiki_research/ | |
Log | Files | Refs |