2000 character limit reached
$\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.02839v3)
Published 5 Sep 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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.