Publisher
Springer International Publishing
Reference61 articles.
1. Aaronson, S., Wigderson, A.: Algebrization: a new barrier in complexity theory. ACM Trans. Comput. Theory 1(1), 2:1–2:54 (2009). https://doi.org/10.1145/1490270.1490272
2. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);E Ábrahám,2016
3. Arora, S., Safra, S.: Probabilistic checking of proofs; a new characterization of NP. In: 33rd Annual Symposium on Foundations of Computer Science, 24–27 October 1992, pp. 2–13. IEEE, Pittsburgh (1992)
4. Arreche, C. (ed.): ISSAC 2018, Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation, New York, USA. ACM Press, New York, July 2018
5. Babai, L.: Trading group theory for randomness. In: Sedgewick [54], pp. 421–429. https://doi.org/10.1145/22145.22192
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献