Simple characterizations of P(#P) and complete problems
Journal of Computer and System Sciences
On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Subtractive Reductions and Complete Problems for Counting Complexity Classes
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On Higher Arthur-Merlin Classes
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Some connections between bounded query classes and non-uniform complexity
Information and Computation
Subtractive reductions and complete problems for counting complexity classes
Theoretical Computer Science - Mathematical foundations of computer science 2000
On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane
Electronic Notes in Theoretical Computer Science (ENTCS)
Complexity of Counting the Optimal Solutions
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
On Counting Generalized Colorings
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
On the Connection between Interval Size Functions and Path Counting
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
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
On the complexity of computing generators of closed sets
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Nonuniform Boolean constraint satisfaction problems with cardinality constraint
ACM Transactions on Computational Logic (TOCL)
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
| Hi-index | 5.23 |