Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Aharonov, D., Naveh, T.: Quantum NP - a survey (2002)
2. Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)
3. Ben-Aroya, A., Schwartz, O., Ta-Shma, A.: Quantum expanders: Motivation and construction. Theory of Computing 6(1), 47–79 (2010)
4. Lecture Notes in Computer Science;A. Chailloux,2008
5. Damgård, I.B., Cramer, R.J.: On monotone function closure of perfect and statistical zero-knowledge. Technical report, Amsterdam, The Netherlands (1996)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献