# P≠NP and All Sets in NP∪coNP Have P-Optimal Proof Systems Relative to an Oracle

@article{Dose2019PNPAA, title={P≠NP and All Sets in NP∪coNP Have P-Optimal Proof Systems Relative to an Oracle}, author={Titus Dose}, journal={ArXiv}, year={2019}, volume={abs/1909.02839} }

No Paper Link Available

#### Topics from this paper

#### 2 Citations

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: The… Expand

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

- Mathematics, Computer Science
- Electron. Colloquium Comput. Complex.
- 2019

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