相关论文: P-Optimal Proof Systems for Each NP-Complete Set b…
We construct an oracle relative to which $\mathrm{P} = \mathrm{NP} \cap \mathrm{coNP}$, but there are no many-one complete sets in $\mathrm{UP}$, no many-one complete disjoint $\mathrm{NP}$-pairs, and no many-one complete disjoint…
We construct an oracle relative to which $\mathrm{NP} = \mathrm{PSPACE}$, but $\mathrm{UP}$ has no many-one complete sets. This combines the properties of an oracle by Hartmanis and Hemachandra [HH88] and one by Ogiwara and Hemachandra…
We build on a working program initiated by Pudl\'ak [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…
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 provide the first evidence for the inherent difficulty of finding complex sets with optimal proof systems. For this, we construct oracles $O_1$ and $O_2$ with the following properties, where $\mathrm{RE}$ denotes the class of recursively…
We study the existence of optimal and p-optimal proof systems for classes in the Boolean hierarchy over $\mathrm{NP}$. Our main results concern $\mathrm{DP}$, i.e., the second level of this hierarchy: If all sets in $\mathrm{DP}$ have…
All versions of this paper contain errors. Therefore, the existence of an oracle relative to which (i) there exist complete disjoint coNP-pairs and (ii) there exist no complete total polynomial search problems must be considered as an open…
Our main results are in the following three sections: 1. We prove new relations between proof complexity conjectures that are discussed in \cite{pu18}. 2. We investigate the existence of p-optimal proof systems for $\mathsf{TAUT}$, assuming…
The $P$ versus $NP$ problem is still unsolved. But there are several oracles with $P$ unequal $NP$ relative to them. Here we will prove, that $P\not=NP$ relative to a $P$-complete oracle. In this paper, we use padding arguments as the proof…
In this paper, we take a closer look at Czerwinski's "${\rm P}\neq{\rm NP}$ relative to a ${\rm P}$-complete oracle" [Cze23]. There are (uncountably) infinitely-many relativized worlds where ${\rm P}$ and ${\rm NP}$ differ, and it is…
Do complexity classes have many-one complete sets if and only if they have Turing-complete sets? We prove that there is a relativized world in which a relatively natural complexity class-namely a downward closure of NP, \rsnnp - has…
Gurevich (1988) conjectured that there is no logic for $\textsf{P}$ or for $\textsf{NP}\cap \textsf{coNP}$. For the latter complexity class, he also showed that the existence of a logic would imply that $\textsf{NP} \cap \textsf{coNP}$ has…
This paper presents the following results on sets that are complete for NP. 1. If there is a problem in NP that requires exponential time at almost all lengths, then every many-one NP-complete set is complete under length-increasing…
Cook and Reckhow 1979 pointed out that NP is not closed under complementation iff there is no propositional proof system that admits polynomial size proofs of all tautologies. Theory of proof complexity generators aims at constructing sets…
Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Krajicek and Pudlak (1989) show that this question is equivalent to the…
Stephen Cook posited SAT is NP-Complete in 1971. If SAT is NP-Complete then, as is generally accepted, any polynomial solution of it must also present a polynomial solution of all NP decision problems. It is here argued, however, that NP is…
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the class UP. We suggest an analogous new approach---weaker in strength of evidence but more broadly applicable---to suggesting that concrete~NP…
Motivated by the theory of proof complexity generators we consider the following $\Sigma^p_2$ search problem $\mbox{DD}_P$ determined by a propositional proof system $P$: given a $P$-proof $\pi$ of a disjunction $\bigvee_i {\alpha}_i$, no…
A family of sets $\mathcal{A}$ is union-closed if it is finite and nonempty with member sets that are all finite and distinct (at least one of which is nonempty) and it satisfies the property $X, Y \in \mathcal{A} \implies X \cup Y \in…