Sciweavers

12 search results - page 2 / 3
» Exponential Lower Bounds for the Pigeonhole Principle
Sort
View
IANDC
2002
61views more  IANDC 2002»
13 years 7 months ago
Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution
Albert Atserias, Maria Luisa Bonet, Juan Luis Este...
APAL
2004
105views more  APAL 2004»
13 years 7 months ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
Emil Jerábek
APAL
2008
84views more  APAL 2008»
13 years 7 months ago
Resolution over linear equations and multilinear proofs
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
Ran Raz, Iddo Tzameret
ECCC
2010
106views more  ECCC 2010»
13 years 6 months ago
Hardness of Parameterized Resolution
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria
TAMC
2010
Springer
14 years 21 days ago
Algebraic Proofs over Noncommutative Formulas
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
Iddo Tzameret