Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems-Reference-Cited by-同舟云学术

Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems

Published:2003 Issue: Volume: Page:81-95
ISSN:0302-9743
Container-title:Principles and Practice of Constraint Programming – CP 2003
language:
Short-container-title:

Author:

Angelsmark Ola,Jonsson Peter

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-45193-8_6

Reference21 articles.

1. Lecture Notes in Computer Science;O. Angelsmark,2002

2. Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters 8(3), 121–123 (1979)

3. Bayardo Jr, R.J., Pehoushek, J.D.: Counting models using connected components. In: Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence AAAI/IAAI, pp. 157–162 (2000)

4. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-1999), pp. 856–857 (1999)

5. Bulatov, A., Dalmau, V.: Towards a dichotomy theorem for the counting constraint satisfaction problem. Technical report, Computing Laboratory, Oxford University (2003), Available from web.comlab.ox.ac.uk/oucl/work/andrei.bulatov/counting.ps

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exact algorithms for counting 3-colorings of graphs;Discrete Applied Mathematics;2022-12

2. A bottom-up algorithm for solving ♯2SAT;Logic Journal of the IGPL;2020-05-05

3. A Parametric Polynomial Deterministic Algorithm for #2SAT;Lecture Notes in Computer Science;2015

4. Recognizing Structural Patterns on Graphs for the Efficient Computation of #2SAT;Lecture Notes in Computer Science;2013

5. On Two Techniques of Combining Branching and Treewidth;Algorithmica;2007-12-14