Author:
Cooney T.,Junge M.,Palazuelos C.,Pérez-García D.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference45 articles.
1. Arora S., Lund C., Motwani R., Sudan M., Szegedy M. (1998) Proof verification and the hardness of approximation problems. Journal of the ACM 45(3): 501–555
2. Arora S., Safra S. (1998) Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM 45(1): 70–122
3. M. Ben-Or, M. Hassidim & H. Pilpel (2008). Quantum Multiprover Interactive Proofs with Communicating Provers. In Proceedings of 49th IEEE Symposium on Foundations of Computer Science, 467–476.
4. H. Buhrman, N. Chandran, S. Fehr, R. Gelles, V. Goyal, R. Ostrovsky & C. Schaffner (2011). Position-Based Quantum Cryptography: Impossibility and Constructions. In Advances in Cryptology - CRYPTO 2011: 31st Annual Cryptology Conference, Proceedings, number 6841 in Lecture Notes in Computer Science, 429–446.
5. Chan J. T. (1994) Facial Structure of the Trace Class. Arch. Math.64(3): 185–187
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献