Approximability of bounded occurrence max ones
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
A dichotomy theorem for typed constraint satisfaction problems
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs
Theoretical Computer Science
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
Hi-index | 5.23 |