Counting solutions to CSP using generating polynomials
From MaRDI portal
Publication:2447541
Recommendations
- Improved algorithms for counting solutions in constraint satisfaction problems
- Complexity of the counting constraint satisfaction problem
- scientific article; zbMATH DE number 4162262
- The Complexity of the Counting Constraint Satisfaction Problem
- The complexity of the counting constraint satisfaction problem
Cites work
- Algorithms for Propositional Model Counting
- Conjunctive-query containment and constraint satisfaction
- Graph minors. I. Excluding a forest
- Graph minors. II. Algorithmic aspects of tree-width
- scientific article; zbMATH DE number 3709576 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1859215 (Why is no real title available?)
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
- Optimal 2-constraint satisfaction via sum-product algorithms
- Treewidth. Computations and approximations
Cited in
(6)- Finding and counting permutations via CSPs
- Polynomial algorithm for solving cross-matching puzzles
- scientific article; zbMATH DE number 4162262 (Why is no real title available?)
- Revisiting counting solutions for the global cardinality constraint
- Counting Models in Integer Domains
- Improved algorithms for counting solutions in constraint satisfaction problems
This page was built for publication: Counting solutions to CSP using generating polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2447541)