Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Aaronson, S., Arkhipov, A.: The computational complexity of linear optics. In: Proc. ACM STOC, To appear. ECCC TR10-170, arXiv:1011.3245 ( to appear, 2011)
2. Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. ACM Commun. 52(2), 89–97 (2009); Earlier version in Proceedings of STOC 2006
3. Gács, P.: Lecture notes on descriptional complexity and randomness (2010),
www.cs.bu.edu/~gacs/papers/ait-notes.pdf
4. Goldreich, O.: On promise problems: a survey. In: Essays in Memory of Shimon Even, pp. 254–290, ECCC TR05-018 (2006)
5. Li, M., Vitányi, P.M.B.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer, Heidelberg (2008)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Quantum Voting in Reach for Ethereum and Algorand;SSRN Electronic Journal;2021
2. Extractors for Turing-Machine Sources;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2012