2 search results - page 1 / 1 » Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Princ... |
FOCS
2002
IEEE
14 years 10 days ago
2002
IEEE
We prove a quasi-polynomial lower bound on the size of bounded-depth Frege proofs of the pigeonhole principle PHPm n where m ´1 · 1 polylog nµn. This lower bound qualitatively ...
TAMC
2010
Springer
14 years 14 days ago
2010
Springer
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 ...