Back to Results
First PageMeta Content
Boolean algebra / Logic in computer science / NP-complete problems / Combinatorics / Boolean satisfiability problem / Electronic design automation / Conjunctive normal form / Partition / True quantified Boolean formula / Theoretical computer science / Mathematics / Computational complexity theory


Completeness in the Polynomial-Time Hierarchy A Compendium∗ Marcus Schaefer
Add to Reading List

Document Date: 2008-10-05 12:49:10

Open Document

File Size: 285,08 KB

Share Result on Facebook
UPDATE