Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference25 articles.
1. Relationships among PL, #P, and the determinant;Allender,1994
2. The expressive power of voting polynomials;Aspnes,1991
3. Perceptrons, PP, and the polynomial hierarchy;Beigel,1992
4. When do extra majority gates help? polylog(n) majority gates are equivalent to one;Beigel;Comput. Complexity,1994
5. Probabilistic polynomial time is closed under parity reductions;Beigel;Inform. Process. Lett.,1991
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Parameterised Counting in Logspace;Algorithmica;2023-04-21
2. Guest Column;ACM SIGACT News;2023-02-28
3. Parameterised Counting in Logspace;LEIBNIZ INT PR INFOR;2021
4. The Complexity of the Inertia;computational complexity;2010-08-30
5. On the Power of Nonlinear Secret-Sharing;SIAM Journal on Discrete Mathematics;2005-01