133 search results - page 11 / 27 » Lower Bounds on the Randomized Communication Complexity of R... |
COLT
2007
Springer
14 years 2 months ago
2007
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 there ...
JOC
2008
13 years 8 months ago
2008
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
ASIACRYPT
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
COLT
2006
Springer
14 years 9 days ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
COCO
2004
Springer
14 years 2 months ago
2004
Springer
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...