Results 1  10
of
538,039
Disjoint NPPairs from Propositional Proof Systems
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, REPORT NO. 83
, 2005
"... For a proof system P we introduce the complexity class DNPP(P) of all disjoint NPpairs for which the disjointness of the pair is efficiently provable in the proof system P. We exhibit structural properties of proof systems which make the previously defined canonical NPpairs of these proof systems ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
For a proof system P we introduce the complexity class DNPP(P) of all disjoint NPpairs for which the disjointness of the pair is efficiently provable in the proof system P. We exhibit structural properties of proof systems which make the previously defined canonical NPpairs of these proof
On provably disjoint NPpairs
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY
, 1994
"... In this paper we study the pairs (U; V ) of disjoint NPsets representable in a theory T of Bounded Arithmetic in the sense that T proves U " V = ;. For a large variety of theories T we exhibit a natural disjoint NPpair which is complete for the class of disjoint NPpairs representable in T ..."
Abstract

Cited by 42 (2 self)
 Add to MetaCart
In this paper we study the pairs (U; V ) of disjoint NPsets representable in a theory T of Bounded Arithmetic in the sense that T proves U " V = ;. For a large variety of theories T we exhibit a natural disjoint NPpair which is complete for the class of disjoint NPpairs representable
Representable Disjoint NPPairs
"... Abstract. We investigate the class of disjoint NPpairs under different reductions. The structure of this class is intimately linked to the simulation order of propositional proof systems, and we make use of the relationship between propositional proof systems and theories of bounded arithmetic as t ..."
Abstract
 Add to MetaCart
Abstract. We investigate the class of disjoint NPpairs under different reductions. The structure of this class is intimately linked to the simulation order of propositional proof systems, and we make use of the relationship between propositional proof systems and theories of bounded arithmetic
Disjoint NPPairs
, 2003
"... We study the question of whether the class DisNP of disjoint pairs (A, B) of NPsets contains a complete pair. The question relates to the question of whether optimal proof systems exist, and we relate it to the previously studied question of whether there exists a disjoint pair of NPsets that is N ..."
Abstract

Cited by 23 (8 self)
 Add to MetaCart
We study the question of whether the class DisNP of disjoint pairs (A, B) of NPsets contains a complete pair. The question relates to the question of whether optimal proof systems exist, and we relate it to the previously studied question of whether there exists a disjoint pair of NP
Canonical Disjoint NPPairs of Propositional Proof Systems
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, REPORT NO. 106
, 2004
"... We prove that every disjoint NPpair is polynomialtime, manyone equivalent to the canonical disjoint NPpair of some propositional proof system. Therefore, the degree structure of the class of disjoint NPpairs and of all canonical pairs is identical. Secondly, we show that this degree structure i ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
We prove that every disjoint NPpair is polynomialtime, manyone equivalent to the canonical disjoint NPpair of some propositional proof system. Therefore, the degree structure of the class of disjoint NPpairs and of all canonical pairs is identical. Secondly, we show that this degree structure
On reducibility and symmetry of disjoint NPpairs
, 2001
"... . We consider some problems about pairs of disjoint NP sets. ..."
Abstract

Cited by 31 (0 self)
 Add to MetaCart
. We consider some problems about pairs of disjoint NP sets.
Reductions between Disjoint NPPairs
 Information and Computation
, 2004
"... We prove that all of the following assertions are equivalent: There is a manyone complete disjoint NPpair; there is a strongly manyone complete disjoint NPpair; there is a Turing complete disjoint NPpair such that all reductions are smart reductions; there is a complete disjoint NPpair for one ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
We prove that all of the following assertions are equivalent: There is a manyone complete disjoint NPpair; there is a strongly manyone complete disjoint NPpair; there is a Turing complete disjoint NPpair such that all reductions are smart reductions; there is a complete disjoint NPpair
Survey of Disjoint NPPairs and Relations to Propositional Proof Systems
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, REPORT NO. 72
, 2005
"... ..."
Results 1  10
of
538,039