206 search results - page 26 / 42 » On the Complexity of Quantum ACC |
ICALP
2003
Springer
14 years 24 days ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
ANTS
2004
Springer
14 years 1 months ago
2004
Springer
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
FCT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...