65 search results - page 10 / 13 » Quantum Entanglement and Communication Complexity |
66
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
125
Voted
SIAMCOMP
2008
15 years 3 months ago
2008
113
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
116
click to vote
COCO
2008
Springer
15 years 5 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...
145
Voted
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...