# Tag Info

## Hot answers tagged proof-complexity

### Graph theoretic restriction to Proofs in Proof Complexity Theory

The most natural restriction on the proof DAG is that it be a tree – that is, any "lemma" (intermediate conclusion) is not used more than once. This property is called being "tree-like". General ...
• 14.1k
Accepted

### Lower Bounds for Frege and Extended Frege

1, 2, 4) The best known lower bounds on extended Frege are the same as for Frege: linear number of lines, and quadratic size. This applies e.g. to the tautologies $\neg^{2n}\top$ (basically, any ...
• 14.9k

### Natural NP-complete problems with "large" witnesses

How about the edge coloring number in a dense graph (aka Chromatic index)? You are given the adjacency matrix of an $n$ vertex graph ($n^2$ bit input), but the natural witness describing the coloring ...
• 3,244

### Are there any propositional proof systems which are not Cook-Reckhow proof systems?

Natural examples of propositional proof systems that do not fall under this definition are algebraic proof systems where the lines in the proof are arbitrary polynomials (not necessarily fully ...
• 4,511

### Graph theoretic restriction to Proofs in Proof Complexity Theory

Müller and Szeider study Resolution proofs where the proof DAG has bounded tree-width or bounded path-width (for suitable extensions of these graph complexity measures to directed graphs.) They show ...
• 4,511

### Natural NP-complete problems with "large" witnesses

Here is an example, which appears a natural problem. Instance: Positive integers, $d_1,\ldots,d_n$ and $k$, all bounded from above by $n$. Question: Does there exist a $k$-colorable graph with ...
• 10.8k

### Natural NP-complete problems with "large" witnesses

I came along some quite natural NP-complete problems that seemingly require long witnesses. The problems, parameterized by integers $C$ and $D$ are as follows: Input: A one-tape TM $M$ Question: Is ...
• 532
Accepted

### Resolution augmented with the rule of symmetry or the rule of extension

First, ER p-simulates SR: for example, ER is p-equivalent to the extended Frege proof system (EF) which is p-equivalent to the substitution Frege proof system (SF), and it is easy to see that SF p-...
• 14.9k
Accepted

### Axioms of Minimum Size Resolution Refutations

With the caveat that I am posting this quickly in a sleep-deprived state, I think the answer is "no" to all three questions. Take the pigeonhole principle formulas PHP^m_n for m pigeons and n holes. ...
Accepted

### Document references describing weaknesses for cutting planes and algebraic proof system?

For each of these proof systems we know that there are some formulas where the shortest proof needs to have exponential length. Some of the earliest examples are an exponential lower bound for the ...

### Natural NP-complete problems with "large" witnesses

Maybe this is a silly "reason/explanation", but for many NP-Complete problems, a solution is a subset of the input (knapsack, vertex cover, clique, dominating set, independent set, max cut, subset sum,...
• 7,090
Accepted

### Is there any work relating type systems and Cook-Reckhow proof systems?

Cook-Reckhow propositional proof systems are nonunifrom. E.g. the computational complexity counterpart to the class of polynomial-size $\mathsf{Extended Frege}$ proofs is the nonuniform complexity ...
• 21.3k

### On the (Cook) definition of a propositional proof system

$f$ is not a prover, it's a proof-checker. $w$ is the proof. And the polynomial is a polynomial of the length of the proof, which could be much larger than the length of the thing being proved. If you ...
• 50.3k

### Graph theoretic restriction to Proofs in Proof Complexity Theory

For strong enough proof systems the graph representation of a proof in the system seems less consequential, since (as Joshua Grochow already commented), DAG-like and tree-like Frege proofs are ...
• 1,899

### On the difference between propositional proof system and polynomially-bounded proof system

In Cook-Reckhow propositional proof systems proof checkers have to run in polynomial time w.r.t. the size of their input. The size of the input is the size of the proof. This is generally not a ...
• 21.3k
Accepted

### Is there a relation between the techniques used by Dan Willard, versus those of Brown and Palsberg, to exclude diagonalization?

I'll defer if someone more knowledgeable on the subject arrives, but I think the answer is that they are not the same. Willard's work is about building theories that avoid the typical formulation of ...
• 640

### Construct proof systems for common algorithmic task, like equivalence of regular expressions

You have a non-deterministic algorithm deciding the problem. If you want to think of it as a proof system for $EQUIV$, then the proof of $(u,v) \in EQUIVE$ is just the string representing the ...
• 21.3k

### Automated theorem proving via unsupervised approaches

Here is a recent one: http://link.springer.com/chapter/10.1007%2F978-3-319-09284-3_17 You can get the fulltext here: http://arxiv.org/abs/1402.2184 It uses some state-of-the-art SAT solvers (see http:...

### Natural NP-complete problems with "large" witnesses

As for your first question, Allender states (in Amplifying Lower Bounds by Means of Self-Reducibility) that no natural NP-complete problem is known to lie outside of NTIME(n). This means that all ...

### IPS upper bound for subset sum axiom

First, Kaveh is correct that the verification for IPS is randomized, so all it would show is $\mathsf{NP} \subseteq \mathsf{coAM}$ (not $\mathsf{NP} = \mathsf{coNP}$). However, this alone would still ...
• 35.9k

### IPS upper bound for subset sum axiom

I think what you are missing is probably the complexity of the proof verification algorithm for IPS. It is generally true that if we have a Cook-Reckhow proof system and have short proofs for a coNP-...
• 21.3k

### Construct proof systems for common algorithmic task, like equivalence of regular expressions

Kaveh's response exemplifies well the Cook-Reckhow notion of an abstract proof system. Nonetheless, for comparison, I point to a recent preprint of mine and Damien Pous: A cut-free cyclic proof ...
• 121
Accepted

### In regards to the tautologies of a polynomially-bounded propositional proof system

Your question is like asking what is the class of formulas for the problem SAT? In the definition of SAT it is fixed to some fixed class, say those based on $\{\lnot, \land, \lor\}$ but it doesn't ...
• 21.3k

### Are there any propositional proof systems which are not Cook-Reckhow proof systems?

Assume that you have an algorithm $A$ which satisfies soundness and completeness. You can define a new proof checker which is sound, complete, and runs in polynomial time: it checks if a given $\pi$ ...
• 21.3k
Accepted

### Proof of SPFA's worst-case complexity?

Here's the algorithm (from the wikipedia page) then a proof of the time bound: ...
• 8,281
1 vote
Accepted

### Is mathematical proof itself NP-hard?

Here is a link to some lecture notes that answer my question - http://www.cs.cornell.edu/~sabhar/publications/iaspcmi-proofcomplexity00.pdf Proof complexity is a vast field of mathematics.
• 119
1 vote
Accepted

### Eliminating tautological axioms in tree-like $k$-DNF resolution

Since I could not find a proof in the literature, I wrote a short note containing the proof.
• 4,511
1 vote

### Resolution vs Nondeterministic Search Problems

If I understood correctly the question, the so-called Buss-Pudlak game provides a simple transformation from a proof system to such a decision tree (see Buss-Pudlak '94 http://math.cas.cz/%7Epudlak/...
• 1,899
1 vote

### Natural NP-complete problems with "large" witnesses

Consider the following variant of the MAXCLIQUE problem. Instance: A circuit $C$ with $2n$ input bits, and of polynomially bounded size in $n$. This circuit implicitly determines a graph on $2^n$ ...
• 10.8k

Only top scored, non community-wiki answers of a minimum length are eligible