# 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