Parameterized Proof Complexity

@article{Dantchev2007ParameterizedPC,
  title={Parameterized Proof Complexity},
  author={Stefan S. Dantchev and B. Martin and Stefan Szeider},
  journal={48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)},
  year={2007},
  pages={150-160}
}
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 propositional CNF formula cannot be satisfied by a truth assignment that sets at most k variables to true, considering k as the parameter (we call such a formula a parameterized contradiction). One could separate the parameterized complexity classes FPT and W(M. Cesati, 2006) by showing that there is no fpt-bounded… Expand
Parameterized Proof Complexity
TLDR
A dichotomy theorem is established that splits the exponential case of Riis’s complexity gap theorem into two subcases, one that admits proofs of size f(k)nO(1) and one that does not and how the set of parameterized contradictions may be embedded into theSet of (ordinary) contradictions by the addition of new axioms. Expand
Parameterized Bounded-Depth Frege Is not Optimal
TLDR
It is proved that the pigeonhole principle requires proofs of size nΩ(k) in parameterized bounded-depth Frege, and, as a special case, in dag-like Parameterized Resolution. Expand
Kernelization, Proof Complexity and Social Choice
TLDR
A notable application of the framework is to impossibility results in computational social choice: it is shown that, for any fixed number of agents, propositional translations of the Arrow and Gibbard-Satterthwaite impossibility theorems have subexponential size Frege proofs. Expand
Parameterized Complexity of Weighted Satisfiability Problems
TLDR
All fragments obtained by semantically restricting circuits or formulae to contain only gates (connectives) from a fixed set B of Boolean functions are considered and a dichotomy result is obtained by showing that for each such B, the weighted satisfiability problems are either W[P]-complete or W[SAT]-complete (for circuits) or efficiently solvable. Expand
Parameterized Complexity of DPLL Search Procedures
TLDR
It is shown that proving the absence of a k-clique requires nΩ(k) steps for a nontrivial distribution of graphs close to the critical threshold, which answers a question asked by Beyersdorff et al. Expand
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems
TLDR
It is shown that the propositional translations of first-order formulae that are universally false, that is, fail in all finite and infinite models, have LS proofs whose rank is constant, independent of the size of the (finite) universe. Expand
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems
TLDR
It is shown that the propositional translationsof FO formulae that are universally true, i.e. hold in all finiteand infinite models, have LS proofs whose rank is constant, independently from the size of the (finite) universe. Expand
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity
  • Søren Riis
  • Computer Science, Mathematics
  • 2008 23rd Annual IEEE Symposium on Logic in Computer Science
  • 2008
TLDR
It is shown that for any non-empty proper subset A sube {(i), (ii), (iii), (iv)} the decision problem of whether a given input FO formula Psi has type belonging to A - is undecidable. Expand
The parameterized complexity of k-flip local search for SAT and MAX SAT
Sat and Max Sat are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the number of clausesExpand
Different Approaches to Proof Systems
The classical approach to proof complexity perceives proof systems as deterministic, uniform, surjective, polynomial-time computable functions that map strings to (propositional) tautologies ThisExpand
...
1
2
3
...

References

SHOWING 1-10 OF 32 REFERENCES
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
TLDR
It is shown that the parameterized setting allows a refined class ification, splitting the second set of proofs as a corollary to a meta-theorem extended Riis’ Complexity Gap Theorem for tree-like resolution. Expand
The Relative Efficiency of Propositional Proof Systems
TLDR
All standard Hilbert type systems and natural deduction systems are equivalent, up to application of a polynomial, as far as minimum proof length goes, and extended Frege systems are introduced, which allow introduction of abbreviations for formulas. Expand
A complexity gap for tree resolution
  • Søren Riis
  • Computer Science, Mathematics
  • computational complexity
  • 2001
TLDR
It is shown that any sequence of tautologies which expresses the validity of a fixed combinatorial principle either is “easy”, i.e. has polynomial size tree-resolution proofs, or is ‘difficult’, or requires exponential sizeTree resolution proofs. Expand
Which Problems Have Strongly Exponential Complexity
For several NP-complete problems, there have been a progression of better but still exponential algorithms. In this paper, we address the relative likelihood of sub-exponential algorithms for theseExpand
Bounded arithmetic, propositional logic, and complexity theory
  • J. Krajícek
  • Mathematics, Computer Science
  • Encyclopedia of mathematics and its applications
  • 1995
This book presents an up-to-date, unified treatment of research in bounded arithmetic and complexity of propositional logic, with emphasis on independence proofs and lower bound proofs. The authorExpand
Compendium of Parameterized Problems
This document includes a list of computational problems that have been studied within the framework of parameterized complexity [81]. It is mainly based on “A Compendium of Parameterized ComplexityExpand
Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]
TLDR
This work shows that INDEPENDENT SET is complete for W, and the W Hierarchy of parameterized problems was defined, and complete problems were identified for the classes W [ t ] for t ⩾ 2. Expand
Parameterized Complexity Theory
  • J. Flum, Martin Grohe
  • Mathematics, Computer Science
  • Texts in Theoretical Computer Science. An EATCS Series
  • 2006
Fixed-Parameter Tractability.- Reductions and Parameterized Intractability.- The Class W[P].- Logic and Complexity.- Two Fundamental Hierarchies.- The First Level of the Hierarchies.- TheExpand
Paths Beyond Local Search: A Tight Bound for Randomized Fixed-Point Computation
In 1983, Akhus proved that randomization can speedup local search. For example, it reduces the query complexity of local search over grid [1 : n]d from ominus(nd-1) to 0(d1/2nd/2). It remains openExpand
Parameterized Complexity
TLDR
An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability, and introduces readers to new classes of algorithms which may be analysed more precisely than was the case until now. Expand
...
1
2
3
4
...