The polynomial-time hierarchy and sparse oracles
Journal of the ACM (JACM)
PP is closed under intersection
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Complexity classes defined by counting quantifiers
Journal of the ACM (JACM)
On the complexity of RAM with various operation sets
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Decision tree approximations of Boolean functions
Theoretical Computer Science
Computational properties of metaquerying problems
ACM Transactions on Computational Logic (TOCL)
The Complexity of Computing the Size of an Interval
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Competing Provers Yield Improved Karp-Lipton Collapse Results
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Comparing phase transitions and peak cost in PP-complete satisfiability problems
Eighteenth national conference on Artificial intelligence
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A characterization of the class of functions computable in polynomial time on Random Access Machines
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Towards ambitious approximation algorithms in stubborn set optimization
Fundamenta Informaticae - Concurrency specification and programming
Counting for Satisfiability by Inverting Resolution
Artificial Intelligence Review
Lower bounds and the hardness of counting properties
Theoretical Computer Science
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
Quantum and classical complexity classes: separations, collapses, and closure properties
Information and Computation
Phase transitions of PP-complete satisfiability problems
Discrete Applied Mathematics
The Complexity of Power-Index Comparison
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
A logical characterization of the counting hierarchy
ACM Transactions on Computational Logic (TOCL)
The computational complexity of probabilistic planning
Journal of Artificial Intelligence Research
Phase transitions of PP-complete satisfiability problems
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
The complexity of weighted and unweighted #CSP
Journal of Computer and System Sciences
The complexity of counting functions with easy decision version
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Survey: The consequences of eliminating NP solutions
Computer Science Review
Towards Ambitious Approximation Algorithms in Stubborn Set Optimization
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
The Chain Method to Separate Counting Classes
Theory of Computing Systems
| Hi-index | 0.00 |