190
Voted
CC
2010
Springer
14 years 9 months ago
2010
Springer
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...
137
Voted
CC
2010
Springer
15 years 1 days ago
2010
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
116
Voted
CC
2010
Springer
15 years 1 days ago
2010
Springer
The inertia of an n
126
Voted
CC
2010
Springer
15 years 1 days ago
2010
Springer
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
179
Voted
CC
2010
Springer
15 years 28 days ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
117
Voted
CC
2010
Springer
15 years 28 days ago
2010
Springer
Abstract. We introduce the concept of future values. Using future values it is possible to represent programs in a new control-flow form such that on any control flow path the data...
116
Voted
CC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
109
Voted
CC
2010
Springer
15 years 2 months ago
2010
Springer
We solve an open problem in communication complexity posed by Kushilevitz and Nisan (1997). Let R (f) and D
87
Voted
CC
2010
Springer
15 years 9 months ago
2010
Springer
121
Voted
CC
2010
Springer
15 years 9 months ago
2010
Springer
Instead of writing SQL queries directly, programmers often prefer writing all their code in a general purpose programming language like Java and having their programs be automatica...