Gap-definable counting classes
Journal of Computer and System Sciences
Simple characterizations of P(#P) and complete problems
Journal of Computer and System Sciences
Subtractive Reductions and Complete Problems for Counting Complexity Classes
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
The Operators minCh and maxCh on the Polynomial Hierarchy
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
SIGACT news complexity theory column 48
ACM SIGACT News
Dimension, entropy rates, and compression
Journal of Computer and System Sciences
Subtractive reductions and complete problems for counting complexity classes
Theoretical Computer Science - Mathematical foundations of computer science 2000
Complexity of Counting the Optimal Solutions
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Complexity of counting the optimal solutions
Theoretical Computer Science
Acceptor-definable counting classes
PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Descriptional and computational complexity of finite automata---A survey
Information and Computation
An algebraic approach to the complexity of generalized conjunctive queries
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
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
Tractable counting of the answers to conjunctive queries
Journal of Computer and System Sciences
| Hi-index | 0.00 |