1391 search results - page 21 / 279 » Complexity Limitations on Quantum Computation |
STOC
2002
ACM
14 years 8 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
AC
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. In 1982, Bennett and Brassard suggested a new way to provide privacy in long distance communications with security based on the correctness of the basic principles of qua...
BMCBI
2008
13 years 7 months ago
2008
Background: Structure-based computational methods are needed to help identify and characterize protein-protein complexes and their function. For individual proteins, the most succ...
FCT
2005
Springer
14 years 1 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...