20831 search results - page 72 / 4167 » Quantum Computation and Information |
ANTS
2004
Springer
14 years 2 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...
TAMC
2007
Springer
14 years 2 months ago
2007
Springer
COCO
2008
Springer
13 years 10 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
STOC
2004
ACM
14 years 9 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
ISVD
2007
IEEE
14 years 3 months ago
2007
IEEE