Sciweavers

COCO
2003
Springer
135views Algorithms» more  COCO 2003»
13 years 10 months ago
Disjoint NP-Pairs
We study the question of whether the class DisjNP of disjoint pairs (A, B) of NP-sets contains a complete pair. The question relates to the question of whether optimal proof system...
Christian Glaßer, Alan L. Selman, Samik Seng...
MFCS
2005
Springer
13 years 10 months ago
Canonical Disjoint NP-Pairs of Propositional Proof Systems
We prove that every disjoint NP-pair is polynomial-time, many-one equivalent to the canonical disjoint NP-pair of some propositional proof system. Therefore, the degree structure ...
Christian Glaßer, Alan L. Selman, Liyu Zhang