Back to Results
First PageMeta Content
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


Computational Complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas Inaugural-Dissertation zur Erlangung des Doktorgrades
Add to Reading List

Document Date: 2011-03-28 06:57:24

Open Document

File Size: 899,80 KB

Share 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