Publisher
Springer Berlin Heidelberg
Reference109 articles.
1. M. Agrawal and E. Allender. An isomorphism theorem for circuit complexity. In IEEE Conference on Computational Complexity, pages 2–11, 1996.
2. M. Agrawal, E. Allender, and S. Rudich. Reductions in circuit complexity: An isomorphism theorem and a gap theorem. submitted; preliminary version appeared as [AA96].
3. J. Aspnes, R. Beigel, M. Furst, and S. Rudich. The expressive power of voting polynomials. Combinatorica, 14:135–148, 1994.
4. E. Allender and V. Gore. Rudimentary reductions revisited. Information Processing Letters, 40:89–95, 1991.
5. E. Allender and V. Gore. A uniform circuit lower bound for the permanent. SIAM Journal on Computing, 23:1026–1049, 1994.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献