Counting constraint satisfaction problems

zbMATH Open1373.68255MaRDI QIDQ4589019FDOQ4589019

Authors: Andrei A. Bulatov 

Publication date: 6 November 2017

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

zbMATH Keywords

complexitypartition functioncountinghomomorphismconstraint satisfaction problem

Mathematics Subject Classification ID

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

Cited In (2)

• Complexity of the counting constraint satisfaction problem
• Enumerating All Solutions for 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)