Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
Structural complexity 1
Journal of the ACM (JACM)
Two remarks on the power of counting
Proceedings of the 6th GI-Conference on Theoretical Computer Science
On some central problems in computational complexity.
On some central problems in computational complexity.
Structural properties of complexity classes (immunity, core)
Structural properties of complexity classes (immunity, core)
Complexity of finite-horizon Markov decision process problems
Journal of the ACM (JACM)
Nonerasing, counting, and majority over the linear time hierarchy
Information and Computation
Complexity results for structure-based causality
Artificial Intelligence
A Generalized Quantifier Concept in Computational Complexity Theory
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
The General Notion of a Dot-Operator
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
When plans distinguish Bayes nets
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
On relations between counting communication complexity classes
Journal of Computer and System Sciences
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
LWPP and WPP are not uniformly gap-definable
Journal of Computer and System Sciences
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
A logical characterization of the counting hierarchy
ACM Transactions on Computational Logic (TOCL)
The computational complexity of probabilistic planning
Journal of Artificial Intelligence Research
Complexity results for structure-based causality
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
Quantum and classical complexity classes: Separations, collapses, and closure properties
Information and Computation
On defining integers in the counting hierarchy and proving arithmetic circuit lower bounds
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Extensions of MSO and the monadic counting hierarchy
Information and Computation
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Most probable explanations in Bayesian networks: Complexity and tractability
International Journal of Approximate Reasoning
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Computational complexity of smooth differential equations
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Information Processing Letters
The computational complexity of monotonicity in probabilistic networks
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
The Chain Method to Separate Counting Classes
Theory of Computing Systems
| Hi-index | 0.01 |