Parikshit Gopalan, Shachar Lovett, Amir Shpilka, 2009 24th Annual IEEE Conference on Computational Complexity, 2009, 173
Rahul Santhanam, “Circuit Lower Bounds for Merlin–Arthur Classes”, SIAM J. Comput., 39:3 (2009), 1038
Benjamin Rossman, Lecture Notes in Computer Science, 5514, Logic, Language, Information and Computation, 2009, 350
Arkadev Chattopadhyay, Avi Wigderson, 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 2009, 43
Ido Ben-Eliezer, Rani Hod, Shachar Lovett, Lecture Notes in Computer Science, 5687, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2009, 366
Kristoffer Arnsfelt Hansen, Lecture Notes in Computer Science, 5675, Computer Science - Theory and Applications, 2009, 117
Kristoffer Arnsfelt Hansen, Michal Koucký, 2009 24th Annual IEEE Conference on Computational Complexity, 2009, 27
Vladimir V. Podolskii, Lecture Notes in Computer Science, 5010, Computer Science – Theory and Applications, 2008, 261
Yael Tauman Kalai, Ran Raz, Lecture Notes in Computer Science, 5126, Automata, Languages and Programming, 2008, 536
Parikshit Gopalan, “Query-Efficient Algorithms for Polynomial Interpolation over Composites”, SIAM J. Comput., 38:3 (2008), 1033