Emergent Mind
$\mathrm{P}\ne\mathrm{NP}$ and All Non-Empty Sets in $\mathrm{NP}\cup\mathrm{coNP}$ Have P-Optimal Proof Systems Relative to an Oracle
(1909.02839)
Published Sep 5, 2019
in
cs.CC
Abstract
As one step in a working program initiated by Pudl\'ak [Pud17] we construct an oracle relative to which $\mathrm{P}\ne\mathrm{NP}$ and all non-empty sets in $\mathrm{NP}\cup\mathrm{coNP}$ have $\mathrm{P}$-optimal proof systems.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.