Sciweavers

5 search results - page 1 / 1
» An Improved Time-Space Lower Bound for Tautologies
Sort
View
COCOON
2009
Springer
13 years 11 months ago
An Improved Time-Space Lower Bound for Tautologies
Scott Diehl, Dieter van Melkebeek, Ryan Williams
ICALP
2005
Springer
13 years 10 months ago
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
Scott Diehl, Dieter van Melkebeek
CC
2006
Springer
101views System Software» more  CC 2006»
13 years 4 months ago
Inductive Time-Space Lower Bounds for Sat and Related Problems
We improve upon indirect diagonalization arguments for lower bounds on explicit problems within the polynomial hierarchy. Our contributions are summarized as follows.
Ryan Williams
APAL
2008
84views more  APAL 2008»
13 years 5 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
SAT
2007
Springer
118views Hardware» more  SAT 2007»
13 years 11 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov