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
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: The… Expand
NP-Completeness, Proof Systems, and Disjoint NP-Pairs
- Mathematics, Computer Science
- Electron. Colloquium Comput. Complex.
The article investigates the relation between three well-known hypotheses, Hunion, Hopps and Hcpair, and characterizations of Hunion and two variants in terms of coNP-completeness and pproducibility of the set of hard formulas of propositional proof systems are obtained. Expand