Back to Results
First PageMeta Content
Complexity classes / Computability theory / Structural complexity theory / Mathematical optimization / NP-complete / NP / P versus NP problem / Oracle machine / Function / Theoretical computer science / Computational complexity theory / Applied mathematics


Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems Christian Glaßer ∗
Add to Reading List

Document Date: 2005-07-07 15:16:38

Open Document

File Size: 346,78 KB

Share Result on Facebook

City

Buffalo / /

Country

Germany / /

Currency

pence / /

/

IndustryTerm

propositional proof systems / proofs systems / proof systems / exhaustive search / p-optimal proof systems / /

Movie

D. 2 / /

Organization

National Science Foundation / Department of Computer Science and Engineering / /

Person

Shimon Even / Christian Glaßer / Alan L. Selman† Liyu Zhang / Yacov Yacobi / /

/

Position

≤pm / A≤pm / Prime Minister / S≤pm / Preliminaries The notations ≤pm / second author / /

ProvinceOrState

New York / /

Technology

dom / simulation / set B. The algorithm / /

SocialTag