On the relative complexity of approximate counting problems
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Subtractive reductions and complete problems for counting complexity classes
Theoretical Computer Science - Mathematical foundations of computer science 2000
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
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 | 0.00 |