Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style
icon Submit Paper


RSS-Feed
REPORTS > DETAIL:

Paper:

TR05-072 | 11th July 2005 00:00

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

Contact
Add Comment
RSS-Feed




TR05-072 Authors: Christian Glaßer, Alan L. Selman, Liyu Zhang
Publication: 14th July 2005 12:30
Downloads: 4140
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