scientific article; zbMATH DE number 4162262

zbMATH Open0707.68036MaRDI QIDQ3489451FDOQ3489451

Authors: Igor Rivin, Ramin Zabin 

Publication date: 1989

Title of this publication is not available (Why is that?)

Recommendations

• Counting solutions to CSP using generating polynomials
• The complexity of constraint satisfaction: an algebraic approach
• Complexity of conservative constraint satisfaction problems
• A proof of the CSP dichotomy conjecture
• Constraint satisfaction problems: complexity and algorithms

zbMATH Keywords

linear programmingconstraint satisfaction problemn-queens problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Linear programming (90C05) Parallel algorithms in computer science (68W10)

Cited In (10)

• An Algebraic Approach to Valued Constraint Satisfaction
• An efficient algorithm for a class of constraint satisfaction problems
• A dynamic programming solution to the \(n\)-queens problem
• An intelligent interactive project management support system
• Linear congruence equations for the solutions of the \(N\)-queens problem
• Counting solutions to CSP using generating polynomials
• Equivariant algorithms for constraint satisfaction problems over coset templates
• An algebraic hardness criterion for surjective constraint satisfaction.
• The constraint satisfaction problem and universal algebra
• Application of exact and heuristic methods to magic square problem

This page was built for publication:

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