Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Aaronson, S.: Limitations of quantum advice and one-way communication. Theory of Computing 1(1), 1–28 (2005),
http://www.theoryofcomputing.org/articles/v001a001
2. Lecture Notes in Computer Science;M. Adcock,2002
3. Lecture Notes in Computer Science;M. Bellare,1993
4. Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, Berkeley, pp. 1444–1451 (1986)
5. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game – or – a completeness theorem for protocols with honest majority. In: STOC 1987, pp. 218–229 (1987)
Cited by
98 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献