Author:
Lipton Richard J.,Williams Ryan
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference32 articles.
1. Allender E. (1989) P-uniform circuit complexity. J. ACM 36(4): 912–928
2. E. Allender (1999). The Permanent Requires Large Uniform Threshold Circuits. Chicago J. Theor. Comput. Sci. (7).
3. E. Allender & M. Koucký (2010). Amplifying Lower Bounds by Means of Self-Reducibility. J. ACM 57(3).
4. E. Allender, M. Koucký, D. Ronneburger, S. Roy & V. Vinay (2001). Time-Space Tradeoffs in the Counting Hierarchy. In IEEE Conference on Computational Complexity, 295–302.
5. E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan & S. P. Vadhan (2005). Short PCPs Verifiable in Polylogarithmic Time. In IEEE Conference on Computational Complexity, 120–134.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献