AI Chat AI Image Generator AI Video Text to Speech

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

10/18/2019
∙
by   Titus Dose, et al.
∙
0
∙

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

READ FULL TEXT

Related Research

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 ...
0 Titus Dose, et al. ∙
research
∙ 04/01/2023

P≠NP relative to a P-complete oracle

The P versus NP problem is still unsolved. But there are several oracles...
0 Reiner Czerwinski, 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. ∙
research
∙ 11/13/2018

Very Hard Electoral Control Problems

It is important to understand how the outcome of an election can be modi...
0 Zack Fitzsimmons, 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
∙ 04/11/2019

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

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal