# P-Optimal Proof Systems for Each Set in NP but no Complete Disjoint NP-pairs Relative to an Oracle

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 (among these, DisjNP and SAT) and asks for new equivalences or oracles that separate corresponding relativized conjectures. We partially answer this question by constructing an oracle relative to which - no many-one complete disjoint NP-pairs exist - and each problem in NP has a P-optimal proof system, i.e., there is no relativizable proof for DisjNPSAT. Since Khaniki [Kha19] constructs an oracle showing that there exists no relativizable proof for the converse implication, the conjectures DisjNP and SAT are independent in a relativized way. In a similar way, our oracle shows that DisjNP and TFNP as well as DisjNP and DisjCoNP are also independent in a relativized way, where TFNP is the conjecture that TFNP has complete elements with respect to polynomial reductions and DisjCoNP is the conjecture that there exist no many-one complete disjoint coNP-pairs.

research
03/28/2019

### Complete Disjoint coNP-Pairs but no Complete Total Polynomial Search Problems Relative to an Oracle

Consider the following conjectures: H1: the set TFNP of all total poly...
research
10/18/2019

### P-Optimal Proof Systems for Each coNP-Complete Set and no Complete Problems in NP∩coNP Relative to an Oracle

We build on a working program initiated by Pudlák [Pud17] and construct ...
research
03/21/2022

### Oracle with P=NP∩ coNP, but no Many-One Completeness in UP, DisjNP, and DisjCoNP

We construct an oracle relative to which P = NP∩coNP, but there are no m...
research
06/22/2021

### A Negative Answer to P?=PSPACE

There is a conjecture on P?=PSPACE in computational complexity zoo. It i...
research
03/08/2019

### Complexity of packing common bases in matroids

One of the most intriguing unsolved questions of matroid optimization is...
research
10/18/2020

### Solving Shisen-Sho boards

We give a simple proof of that determining solvability of Shisen-Sho boa...
research
06/04/2019

### Shellings from relative shellings, with an application to NP-completeness

Shellings of simplicial complexes have long been a useful tool in topolo...