CC
2010
Springer
13 years 7 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...
CC
2010
Springer
13 years 10 months 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...
CC
2010
Springer
13 years 10 months ago
2010
Springer
The inertia of an n
CC
2010
Springer
13 years 10 months 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...
CC
2010
Springer
13 years 10 months 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...
CC
2010
Springer
13 years 10 months 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...
CC
2010
Springer
14 years 17 days 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 ...
CC
2010
Springer
14 years 17 days ago
2010
Springer
We solve an open problem in communication complexity posed by Kushilevitz and Nisan (1997). Let R (f) and D
CC
2010
Springer
14 years 7 months ago
2010
Springer
CC
2010
Springer
14 years 7 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...