Result 1 to 20 of 44 total
Quantum predictive learning and communication complexity with single input. (English)
Quantum Inf. Comput. 12, No. 7-8, 575-588 (2012).
1
Quantum algorithm for the Boolean hidden shift problem. (English)
Fu, Bin (ed.) et al., Computing and combinatorics. 17th annual international conference, COCOON 2011, Dallas, TX, USA, August 14‒16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22684-7/pbk). Lecture Notes in Computer Science 6842, 158-167 (2011).
2
Quantum algorithm for the Boolean hidden shift problem. (English)
Comput. Res. Repos. 2011, Article No. 1103.3017 (2011).
3
Quantum algorithm for the Boolean hidden shift problem (English)
COCOON, 158-167 (2011).
4
A separation of NP and conp in multiparty communication complexity. (English)
Theory Comput. 6, Paper No. 10, 227-245, electronic only (2010).
5
A separation of NP and conp in multiparty communication complexity. (English)
Comput. Res. Repos. 2010, Article No. 1004.0817 (2010).
6
A separation of NP and conp in multiparty communication complexity (English)
Theory of Computing 6, No. 1, 227-245 (2010).
7
Quantum predictive learning and communication complexity with single input (English)
COLT, 207-217 (2010).
8
Bounded-error quantum state identification and exponential separations in communication complexity. (English)
SIAM J. Comput. 39, No. 1, 1-24 (2009).
9
Entanglement-resistant two-prover interactive proof systems and non-adaptive PIR’s. (English)
Quantum Inf. Comput. 9, No. 7-8, 648-656 (2009).
10
Entanglement-resistant two-prover interactive proof systems and non-adaptive pir’s (English)
Quantum Information & Computation 9, No. 7, 648-656 (2009).
11
Exponential separation for one-way quantum communication complexity, with applications to cryptography. (English)
SIAM J. Comput. 38, No. 5, 1695-1708 (2008).
12
Quantum algorithms for evaluating Min-Max trees. (English)
Kawano, Yasuhito (ed.) et al., Theory of quantum computation, communication, and cryptography. Third workshop, TQC 2008, Tokyo, Japan, January 30‒February 1, 2008. Revised selected papers. Berlin: Springer (ISBN 978-3-540-89303-5/pbk). Lecture Notes in Computer Science 5106, 11-15 (2008).
13
Classical interaction cannot replace a quantum message. (English)
STOC’08. Proceedings of the 40th annual ACM symposium on theory of computing 2008, Victoria, Canada, May 17‒20, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-047-0). 95-102 (2008).
14
On the role of shared entanglement. (English)
Quantum Inf. Comput. 8, No. 1-2, 82-95 (2008).
15
On the role of shared entanglement (English)
Quantum Information & Computation 8, No. 1, 82-95 (2008).
16
Quantum algorithms for evaluating min-maxtrees (English)
TQC, 11-15 (2008).
17
Exponential separation of quantum and classical non-interactive multi-party communication complexity (English)
IEEE Conference on Computational Complexity, 332-339 (2008).
18
Classical interaction cannot replace a quantum message (English)
STOC, 95-102 (2008).
19
Classical interaction cannot replace a quantum message. (English)
Electron. Colloq. Comput. Complex. 14, No. 058 (2007).
20
Result 1 to 20 of 44 total
Start
Contact
Print
General Help
