195 research outputs found
On the existence of complete disjoint NP-pairs
Disjoint NP-pairs are an interesting model of computation with important applications in cryptography and proof complexity. The question whether there exists a complete disjoint NP-pair was posed by Razborov in 1994 and is one of the most important problems in the field. In this paper we prove that there exists a many-one hard disjoint NP-pair which is computed with access to a very weak oracle (a tally NP-oracle). In addition, we exhibit candidates for complete NP-pairs and apply our results to a recent line of research on the construction of hard tautologies from pseudorandom generators
On the existence of strong proof complexity generators
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 of tautologies hard for strong and possibly for all proof systems. We
focus at a conjecture from K.2004 in foundations of the theory that there is a
proof complexity generator hard for all proof systems. This can be equivalently
formulated (for p-time generators) without a reference to proof complexity
notions as follows:
* There exist a p-time function stretching each input by one bit such
that its range intersects all infinite NP sets.
We consider several facets of this conjecture, including its links to bounded
arithmetic (witnessing and independence results), to time-bounded Kolmogorov
complexity, to feasible disjunction property of propositional proof systems and
to complexity of proof search. We argue that a specific gadget generator from
K.2009 is a good candidate for . We define a new hardness property of
generators, the -hardness, and shows that one specific gadget
generator is the -hardest (w.r.t. any sufficiently strong proof
system). We define the class of feasibly infinite NP sets and show, assuming a
hypothesis from circuit complexity, that the conjecture holds for all feasibly
infinite NP sets.Comment: preliminary version August 2022, revised July 202
A remark on pseudo proof systems and hard instances of the satisfiability problem
We link two concepts from the literature, namely hard sequences for the satisfiability problem sat and so-called pseudo proof systems proposed for study by Krajícek. Pseudo proof systems are elements of a particular nonstandard model constructed by forcing with random variables. We show that the existence of mad pseudo proof systems is equivalent to the existence of a randomized polynomial time procedure with a highly restrictive use of randomness which produces satisfiable formulas whose satisfying assignments are probably hard to find.Peer ReviewedPostprint (published version
Information in propositional proofs and algorithmic proof search
We study from the proof complexity perspective the (informal) proof search
problem:
Is there an optimal way to search for propositional proofs?
We note that for any fixed proof system there exists a time-optimal proof
search algorithm. Using classical proof complexity results about reflection
principles we prove that a time-optimal proof search algorithm exists w.r.t.
all proof systems iff a p-optimal proof system exists.
To characterize precisely the time proof search algorithms need for
individual formulas we introduce a new proof complexity measure based on
algorithmic information concepts. In particular, to a proof system we
attach {\bf information-efficiency function} assigning to a
tautology a natural number, and we show that:
- characterizes time any -proof search algorithm has to use on
and that for a fixed there is such an information-optimal algorithm,
- a proof system is information-efficiency optimal iff it is p-optimal,
- for non-automatizable systems there are formulas with short
proofs but having large information measure .
We isolate and motivate the problem to establish {\em unconditional}
super-logarithmic lower bounds for where no super-polynomial size
lower bounds are known. We also point out connections of the new measure with
some topics in proof complexity other than proof search.Comment: Preliminary version February 202
On extracting computations from propositional proofs (a survey)
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of functions associated with the tautologies. Such bounds can potentially be used to prove (conditional or unconditional) lower bounds on the lengths of proofs of these tautologies and show separations of some weak proof systems. The prototype are the results showing the feasible interpolation property for resolution. In order to prove similar results for systems stronger than resolution one needs to define suitable generalizations of boolean circuits. We will survey the known results concerning this project and sketch in which direction we want to generalize them
Iterated lower bound formulas: a diagonalization-based approach to proof complexity
We propose a diagonalization-based approach to several important questions in proof complexity. We illustrate this approach in the context of the algebraic proof system IPS and in the context of propositional proof systems more generally. We use the approach to give an explicit sequence of CNF formulas {φn} such that VNP ≠ VP iff there are no polynomial-size IPS proofs for the formulas φn. This provides a natural equivalence between proof complexity lower bounds and standard algebraic complexity lower bounds. Our proof of this fact uses the implication from IPS lower bounds to algebraic complexity lower bounds due to Grochow and Pitassi together with a diagonalization argument: the formulas φn themselves assert the non-existence of short IPS proofs for formulas encoding VNP ≠ VP at a different input length. Our result also has meta-mathematical implications: it gives evidence for the difficulty of proving strong lower bounds for IPS within IPS. For any strong enough propositional proof system R, we define the *iterated R-lower bound formulas*, which inductively assert the non-existence of short R proofs for formulas encoding the same statement at a different input length, and propose them as explicit hard candidates for the proof system R. We observe that this hypothesis holds for Resolution following recent results of Atserias and Muller and of Garlik, and give evidence in favour of it for other proof systems
- …