![NP-complete problems / Logic in computer science / Complexity classes / Boolean algebra / 2-satisfiability / Boolean satisfiability problem / Conjunctive normal form / Outerplanar graph / Planar graph / Theoretical computer science / Graph theory / Computational complexity theory NP-complete problems / Logic in computer science / Complexity classes / Boolean algebra / 2-satisfiability / Boolean satisfiability problem / Conjunctive normal form / Outerplanar graph / Planar graph / Theoretical computer science / Graph theory / Computational complexity theory](https://www.pdfsearch.io/img/20a64f65678f8f0e33a20b408d2114b1.jpg)
| Document Date: 2011-03-28 06:57:24 Open Document File Size: 899,80 KBShare Result on Facebook
Company Vertex / CNF / M HF / / IndustryTerm far best algorithm / industrial applications / / Person Ewald Speckenmeyer / Tatjana Schmidt / Horn Formulas / / Technology artificial intelligence / appropriate polynomial-time 2-SAT algorithm / 2.3 Algorithms / 3.1 Algorithm / /
SocialTag |