29 search results - page 1 / 6 » Separation results for the size of constant-depth propositio... |
APAL
2005
13 years 4 months ago
2005
AML
2011
12 years 12 months ago
2011
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
AML
2008
13 years 5 months ago
2008
A new approach to defining complexity of propositional formulas and proofs is suggested. Instead of measuring the size of these syntactical structures in the propositional languag...
ECCC
2007
13 years 4 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...