33 search results - page 6 / 7 » coco 2009 |
COCO
2009
Springer
13 years 12 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
COCO
2009
Springer
13 years 12 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
COCO
2009
Springer
13 years 12 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
COCO
2009
Springer
13 years 9 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
COCO
2009
Springer
13 years 12 months ago
2009
Springer
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...