# NP-Completeness, Proof Systems, and Disjoint NP-Pairs

@inproceedings{Dose2019NPCompletenessPS,
title={NP-Completeness, Proof Systems, and Disjoint NP-Pairs},
author={Titus Dose and Christian Gla{\ss}er},
booktitle={Electron. Colloquium Comput. Complex.},
year={2019}
}
• Published in
Electron. Colloquium Comput…
2019
• Mathematics, Computer Science
The article investigates the relation between three well-known hypotheses. Hunion: the union of disjoint ≤m-complete sets for NP is ≤m-complete Hopps: there exist optimal propositional proof systems Hcpair: there exist ≤pp m -complete disjoint NP-pairs The following results are obtained: The hypotheses are pairwise independent under relativizable proofs, except for the known implication Hopps ⇒ Hcpair. An answer to Pudlák’s question for an oracle relative to which ¬Hcpair, ¬Hopps, and UP has ≤m… Expand
7 Citations

#### Tables and Topics from this paper

J an 2 02 0 P-Optimal Proof Systems for Each NP-Complete Set but no Complete Disjoint NP-Pairs Relative to an Oracle Titus Dose
• 2021
Pudlák [Pud17] lists several major conjectures from the field of proof complexity and asks for oracles that separate corresponding relativized conjectures. Among these conjectures are: • DisjNP: TheExpand
An oracle separating conjectures about incompleteness in the finite domain
• Titus Dose
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 2020
There is no relativizable proof for the implication DisjNP ∧ UP ∧ NP ∩ coNP ⇒ SAT, so an oracle is constructed relative to which Disj NP, ¬ SAT, UP, and NP ∪ coNP hold. Expand
A pr 2 01 9 P-Optimal Proof Systems for Each Set in NP but no Complete Disjoint NP-pairs Relative to an Oracle Titus Dose
• 2019
Consider the following conjectures: • DisjNP: there exist no many-one complete disjoint NP-pairs. • SAT: there exist P-optimal proof systems for SAT. Pudlák [Pud17] lists several conjectures (amongExpand
Complete Disjoint coNP-Pairs but no Complete Total Polynomial Search Problems Relative to an Oracle
An oracle relative to which H1 holds and H2 does not hold is constructed, which partially answers a question by Pudlak [Pud17], who lists several hypotheses and asks for oracles that show corresponding relativized hypotheses to be different. Expand
P-Optimal Proof Systems for Each NP-Complete Set but no Complete Disjoint NP-Pairs Relative to an Oracle.
An oracle is constructed relative to which there is no relativizable proof for the implication that NP does not contain many-one complete sets that have P-optimal proof systems. Expand
$\mathrm{P}$-Optimal Proof Systems for Each Set in $\mathrm{coNP}$ and no Complete Problems in $\mathrm{NP}\cap\mathrm{coNP}$ Relative to an Oracle
This work builds on a working program initiated by Pudlak and constructs an oracle relative to which each set in coNP has $\mathrm{coNP}$-optimal proof systems and coNP does not have complete problems. Expand
Dimension and the Structure of Complexity Classes
• Computer Science
• 2021
We prove three results on the dimension structure of complexity classes. 1. The Point-to-Set Principle, which has recently been used to prove several new theorems in fractal geometry, hasExpand

#### References

SHOWING 1-10 OF 43 REFERENCES
An oracle separating conjectures about incompleteness in the finite domain
• Titus Dose
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 2020
There is no relativizable proof for the implication DisjNP ∧ UP ∧ NP ∩ coNP ⇒ SAT, so an oracle is constructed relative to which Disj NP, ¬ SAT, UP, and NP ∪ coNP hold. Expand
The Informational Content of Canonical Disjoint NP-Pairs
• Computer Science, Mathematics
• Int. J. Found. Comput. Sci.
• 2007
A new connection between propositional proof systems, disjoint NP-pairs, and unions of disjointed NP-complete sets is demonstrated and shown to be generalizes previous results by Pudlak and Beyersdorff. Expand
Reductions between disjoint NP-pairs
• Computer Science, Mathematics
• Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.
• 2004
It is shown that under the reasonable assumption UP /spl cap/ co-UP has a P-bi-immune set that there exist disjoint NP-pairs such that (A,B) is truth-table reducible to (C,D), but there is no smart reduction between them. Expand
Canonical Disjoint NP-Pairs of Propositional Proof Systems
• Computer Science, Mathematics
• MFCS
• 2004
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 of the class ofExpand
Disjoint NP-pairs
• Computer Science, Mathematics
• 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.
• 2003
It is shown under reasonable hypotheses that nonsymmetric disjoint NP-pairs exist, and an oracle relative to which complete pairs exist, but optimal proof systems do not exist is constructed, which provide additional evidence for the existence of P-inseparable disj joint NP-Pairs. Expand
On provably disjoint NP-pairs
• A. Razborov
• Computer Science, Mathematics
• Electron. Colloquium Comput. Complex.
• 1994
This paper study the pairs (U,V) of disjoint NP-sets representable in a theory T of Bounded Arithmetic in the sense that T proves U intersection V = \emptyset, which allows the approach to showing independence of central open questions in Boolean complexity from theories of Bounding Arithmetic to be clarified. Expand
Disjoint NP-Pairs from Propositional Proof Systems
It is demonstrated that non-equivalent proof systems can have equivalent canonical pairs and that depending on the properties of the proof systems different scenarios for DNPP(P) and the reductions between the canonical pairs exist. Expand
Representable Disjoint NP-Pairs
A pair is exhibited which is complete under strong reductions for all disjoint NP-pairs representable in a theory, and this pair is used to explain the simulation order of NP- pairs under these reductions. Expand
Classes of representable disjoint NP-pairs
It is demonstrated that non-equivalent proof systems can have equivalent canonical pairs and that depending on the properties of the proof systems different scenarios for DNPP(P) and the reductions between the canonical pairs exist. Expand
Optimal proof systems imply complete sets for promise classes
• Computer Science, Mathematics
• Inf. Comput.
• 2003
The existence of (p-)optimal proof systems and the existence of complete problems for certain promise complexity classes like UP, NP ∩ Sparse, RP or BPP are shown. Expand