We present the first example of a natural distribution on instances of an NP-complete problem, with the following properties.
Nov 26, 2002 · In the present paper we prove several generalisations and extensions of the Complexity-Gap theorem. 1. The gap for stronger systems, Res , is ...
It essentially states that there are arbitrarily large computable gaps in the hierarchy of complexity classes. For any computable function that represents an ...
A Gap in Average Proof Complexity ... of an NP-complete problem, with the following properties. ... with small clause density (significantly less than n ).
Under non-uniform distributions the gap can even be super-exponential. We also prove some general bounds for average-case complexity and show that the average- ...
Nov 7, 2012 · Abstract. This work is concerned with the proof-complexity of certifying that optimization problems do not have good solutions.
In this thesis we explore the limitations of efficient computation by way of the com- plexity of proofs. One of the goals of theoretical computer science is ...
A Gap in Average Proof Complexity. We present the first example of a natural distribution on instances of an NP-complete problem, with the following ...
A proof system for a language L is a polynomial time algorithm V such that for all inputs x, x 2L iff there exists a string P such that V accepts input (x; P).
We study the proof complexity of Taut, the class of Second-Order Existential (SO∃) logical sentences which fail in all finite models. The Complexity-Gap theorem ...
Missing: Average | Show results with:Average