Back to Results
First PageMeta Content
Complexity classes / NP / P versus NP problem / PP / Sparse language / P / Cook–Levin theorem / NP-hard / Theoretical computer science / Computational complexity theory / Applied mathematics


Properties of NP-Complete Sets Christian Glaßer, A. Pavan, Alan L. Selman, Samik Sengupta ∗ †
Add to Reading List

Document Date: 2004-01-15 13:02:20

Open Document

File Size: 1,50 MB

Share Result on Facebook

City

Ames / Wurzburg / Buffalo / /

Country

Germany / /

/

Facility

Bell Hall / Iowa State University / /

IndustryTerm

binary search takes / decision algorithm / binary search / nondeterministic polynomial-time-bounded algorithm / /

Organization

Iowa State University / National Science Foundation / Department of Computer Science / Universitat / /

Person

Alan L. Selman / /

Position

L≤pm / ≤pm / Prime Minister / /

ProvinceOrState

New York / Iowa / /

Technology

nondeterministic polynomial-time-bounded algorithm / decision algorithm / /

SocialTag