Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR05-072 | 11th July 2005 00:00

Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems

RSS-Feed




TR05-072
Authors: Christian Gla├čer, Alan L. Selman, Liyu Zhang
Publication: 14th July 2005 12:30
Downloads: 1750
Keywords: 


Abstract:

We survey recent results on disjoint NP-pairs. In particular, we survey the relationship of disjoint NP-pairs to the theory of proof systems for propositional calculus.



ISSN 1433-8092 | Imprint