PNP and All 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 sets in NP∪coNP have P-optimal proof systems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/05/2019

PNP and All Non-Empty 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
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
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
04/06/2020

A limitation on the KPT interpolation

We prove a limitation on a variant of the KPT theorem proposed for propo...
research
08/14/2023

O-1: Self-training with Oracle and 1-best Hypothesis

We introduce O-1, a new self-training objective to reduce training bias ...
research
10/21/2022

Complexity and Ramsey Largeness of Sets of Oracles Separating Complexity Classes

We prove two sets of results concerning computational complexity classes...
research
03/08/2023

Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle

It is a long-standing open question to construct a classical oracle rela...

Please sign up or login with your details

Forgot password? Click here to reset