40 search results - page 8 / 8 » Exponential Lower Bounds for the Running Time of DPLL Algori... |
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
STOC
1999
ACM
13 years 9 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
TCC
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
: We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization. For ...
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...