PNP and All Non-Empty Sets in NP∪coNP Have P-Optimal Proof Systems Relative to an Oracle

09/05/2019
by   Titus Dose, et al.
0

As one step in a working program initiated by Pudlák [Pud17] we construct an oracle relative to which PNP and all non-empty sets in NP∪coNP have P-optimal proof systems.

READ FULL TEXT
research
09/05/2019

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

As one step in a working program initiated by Pudlák [Pud17] we construc...
research
10/18/2019

P-Optimal Proof Systems for Each Set in coNP 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
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
04/28/2023

Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NP

We study the existence of optimal and p-optimal proof systems for classe...
research
04/06/2020

A limitation on the KPT interpolation

We prove a limitation on a variant of the KPT theorem proposed for propo...
research
07/05/2020

A stochastic calculus approach to the oracle separation of BQP and PH

After presentations of Raz and Tal's oracle separation of BQP and PH res...
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...

Please sign up or login with your details

Forgot password? Click here to reset