Counting constraint satisfaction problems

MaRDI QIDQ4589019zbMATH OpenFDO

Authors Andrei A. Bulatov

Publication date 6 November 2017

zbMATH Keywords

complexityconstraint satisfaction problemcountinghomomorphismpartition function

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Complexity of the counting constraint satisfaction problem
• Counting constraint satisfaction problems
• The complexity of the counting constraint satisfaction problem
• Towards a dichotomy theorem for the counting constraint satisfaction problem
• Computational Complexity of Constraint Satisfaction

Cited in

(3)

• Complexity of the counting constraint satisfaction problem
• Enumerating All Solutions for Constraint Satisfaction Problems
• Counting constraint satisfaction problems

This page was built for publication: Counting constraint satisfaction problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589019)