Computer Science > Computational Complexity
[Submitted on 18 Oct 2019 (v1), last revised 9 Jan 2020 (this version, v2)]
Title:$\mathrm{P}$-Optimal Proof Systems for Each $\mathrm{coNP}$-Complete Set and no Complete Problems in $\mathrm{NP}\cap\mathrm{coNP}$ Relative to an Oracle
View PDFAbstract:We build on a working program initiated by Pudlák [Pud17] and construct an oracle relative to which each $\mathrm{coNP}$-complete set has $\mathrm{P}$-optimal proof systems and $\mathrm{NP}\cap\mathrm{coNP}$ does not have complete problems.
Submission history
From: Titus Dose [view email][v1] Fri, 18 Oct 2019 18:06:19 UTC (32 KB)
[v2] Thu, 9 Jan 2020 15:30:25 UTC (32 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
Connected Papers (What is Connected Papers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.