Subject
Applied Mathematics,Artificial Intelligence,Theoretical Computer Science,Software
Reference36 articles.
1. Computational Complexity: A Modern Approach;Arora,2009
2. Phase transitions of PP-complete satisfiability problems;Bailey;Discrete Appl. Math.,2007
3. The polynomial-time hierarchy and sparse oracles;Balcázar;J. ACM,1986
4. PP is closed under intersection;Beigel;J. Comput. Syst. Sci.,1995
5. The complexity of weighted and unweighted #CSP;Bulatov;J. Comput. Syst. Sci.,2012
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献