2479 search results - page 44 / 496 » Quantum complexity theory |
121
click to vote
ICALP
2003
Springer
15 years 8 months 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...
100
click to vote
ANTS
2004
Springer
15 years 8 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...
116
click to vote
CORR
2010
Springer
15 years 3 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...
110
click to vote
CLEF
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. This working notes paper describes our first participation in the ImageCLEF2010 Wikipedia Retrieval Task[1]. In this task, we mainly test our Quantum Theory inspired retr...