Sciweavers

19 search results - page 3 / 4
» Resolution lower bounds for the weak pigeonhole principle
Sort
View
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
SIAMCOMP
2002
112views more  SIAMCOMP 2002»
13 years 7 months ago
The Efficiency of Resolution and Davis--Putnam Procedures
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...
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
MLQ
2010
148views more  MLQ 2010»
13 years 6 months ago
Abelian groups and quadratic residues in weak arithmetic
We investigate the provability of some properties of abelian groups and quadratic residues in variants of bounded arithmetic. Specifically, we show that the structure theorem for...
Emil Jerábek
CCA
2009
Springer
14 years 2 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi