Improved algorithms for counting solutions in constraint satisfaction problems
2003 (English)In: Principles and Practice of Constraint Programming, 9th International Conference CP 2003,2003, 2003, Vol. 2833, 81-95 p.Conference paper (Refereed)
Counting the number of solutions to CSP instances has vast applications in several areas ranging from statistical physics to artificial intelligence. We provide a new algorithm for counting the number of solutions to binary CSP s which has a time complexity ranging from O ((d/4 . alpha(4))(n)) to O((alpha + alpha(5) + [d/4 - 1] . alpha(4))(n)) (where alpha approximate to 1.2561) depending on the domain size d greater than or equal to 3. This is substantially faster than previous algorithms, especially for small d. We also provide an algorithm for counting k-colourings in graphs and its running time ranges from O ([log(2) k](n)) to O ([log(2) k + 1](n)) depending on k greater than or equal to 4. Previously, only an O(1.8171(n)) time algorithm for counting 3-colourings were known, and we improve this upper bound to O(1.7879(n)).
Place, publisher, year, edition, pages
2003. Vol. 2833, 81-95 p.
, Lecture Notes in Computer Science, ISSN ISSN 0302-9743, EISSN 1611-3349 ; 2833
Engineering and Technology Computer Science
IdentifiersURN: urn:nbn:se:liu:diva-48440OAI: oai:DiVA.org:liu-48440DiVA: diva2:269336
Constraint Programming 2003 (CP-2003)