Author:
Agrawal Manindra,Allender Eric,Impagliazzo Russell,Pitassi Toniann,Rudich Steven
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Complexity of Online Graph Games;Lecture Notes in Computer Science;2024
2. On derandomizing algorithms that err extremely rarely;Proceedings of the forty-sixth annual ACM symposium on Theory of computing;2014-05-31
3. A Model for Analyzing Black-Box Optimization;Lecture Notes in Computer Science;2003
4. The First-Order Isomorphism Theorem;FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science;2001
5. Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem;Journal of Computer and System Sciences;1998-10