3 search results - page 1 / 1 » The complexity of counting colourings and independent sets i... |
CC
2000
Springer
13 years 5 months ago
2000
Springer
STACS
2010
Springer
14 years 7 days ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
FOCS
2009
IEEE
14 years 4 hour ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...