AI Chat AI Image Generator AI Video AI Music Generator

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

10/18/2019

∙

by Titus Dose, et al.

∙

∙

We build on a working program initiated by Pudlák [Pud17] and construct an oracle relative to which each set in coNP has P-optimal proof systems and NP∩coNP does not have complete problems.

page 1

page 2

page 3

page 4

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 ...

0 Titus Dose, et al. ∙

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...

0 Titus Dose, et al. ∙

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...

0 Titus Dose, et al. ∙

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...

0 Titus Dose, et al. ∙

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...

0 Andrés Santamaría-Galvis, et al. ∙

research

∙ 05/04/2022

Separations in Proof Complexity and TFNP

It is well-known that Resolution proofs can be efficiently simulated by ...

0 Mika Göös, et al. ∙

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...

0 Anton Ehrmanntraut, et al. ∙