Complexity of the counting constraint satisfaction problem

MaRDI QIDQ3565118zbMATH OpenFDO

Authors Andrei A. Bulatov

Publication date 27 May 2010

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Counting constraint satisfaction problems
• The 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

Cited in

(16)

• Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers.
• The complexity of the counting constraint satisfaction problem
• The complexity of counting locally maximal satisfying assignments of Boolean CSPs
• The complexity of valued constraint satisfaction
• Computational Complexity of Constraint Satisfaction
• Homogenization of parabolic equations with an arbitrary number of scales in both space and time
• The complexity of constraint satisfaction: an algebraic approach
• Counting constraint satisfaction problems
• Counting constraint satisfaction problems
• Constraint satisfaction problems over numeric domains
• Counting solutions to CSP using generating polynomials
• On the complexity of \#CSP
• Approximate Counting CSP Seen from the Other Side
• scientific article; zbMATH DE number 7561704 (Why is no real title available?)
• Algebra and the complexity of digraph CSPs: a survey
• The Complexity of the Counting Constraint Satisfaction Problem

This page was built for publication: Complexity of the counting constraint satisfaction problem

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