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

City

Chicago / /

Company

VERTEX / CNF / 3SAT / /

Country

United States / /

/

Facility

CTI DePaul University / /

IndustryTerm

literature search / debate systems / /

MarketIndex

SET 10 / /

OperatingSystem

L3 / /

Organization

DePaul University / Compendium∗ Marcus Schaefer School / IN FOL / /

Person

MIN DNF TAUTOLOGY / Chris Umans / Christopher Umans / Marcus Schaefer / /

/

Position

Σpm / model for ϕ / /

ProvinceOrState

Illinois / /

Region

East California / /

SocialTag