Author:
Durand Arnaud,Haak Anselm,Kontinen Juha,Vollmer Heribert
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference24 articles.
1. The complexity of computing the permanent;Valiant;Theor. Comput. Sci.,1979
2. Descriptive complexity of #P functions;Saluja;J. Comput. Syst. Sci.,1995
3. A logical characterization of the counting hierarchy;Kontinen;ACM Trans. Comput. Log.,2009
4. Introduction to Circuit Complexity - a Uniform Approach;Vollmer,1999
5. Arithmetic circuits and counting complexity classes;Allender,2004
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献