Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference9 articles.
1. Aaronson, S., Arkhipov, A.: The computational complexity of linear optics. Theory Comput. 9, 143–252 (2013). Conference version in Proceedings of ACM STOC’2011. ECCC TR10-170. arXiv:1011.3245
2. Barak, B.: Non-black-box techniques in cryptography. Ph.D. thesis, Weizmann Institute of Science (2003). www.wisdom.weizmann.ac.il/~oded/PS/boaz-phd.ps
3. Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. Commun. ACM 52(2), 89–97 (2009). Earlier version in Proceedings of STOC’2006
4. Gács, P.: Lecture notes on descriptional complexity and randomness (2010). www.cs.bu.edu/~gacs/papers/ait-notes.pdf
5. Goldreich, O.: On promise problems: a survey. In: Essays in Memory of Shimon Even, pp. 254–290 (2006). ECCC TR05-018
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献