Simple characterizations of P(#P) and complete problems
Journal of Computer and System Sciences
The complexity of query reliability
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
A common algebraic description for probabilistic and quantum computations
Theoretical Computer Science - Mathematical foundations of computer science 2004
Subtractive reductions and complete problems for counting complexity classes
Theoretical Computer Science - Mathematical foundations of computer science 2000
The Complexity of Tensor Circuit Evaluation
Computational Complexity
The complexity of counting functions with easy decision version
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The Chain Method to Separate Counting Classes
Theory of Computing Systems
| Hi-index | 5.23 |