Constraint satisfaction -- algorithms and complexity analysis

DOI10.1016/0020-0190(95)00089-UzbMATH Open1051.68545OpenAlexW2053738200MaRDI QIDQ672029FDOQ672029

Authors: Walter Hower 

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00089-u

Recommendations

• scientific article; zbMATH DE number 1234562
• Fast parallel constraint satisfaction
• Constraints, consistency and closure
• scientific article; zbMATH DE number 1094771
• Constraint satisfaction problems: Algorithms and applications

zbMATH Keywords

Computational complexityConstraint satisfactionCombinatorial problemsAnalysis and design of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• From local to global consistency
• Decomposing constraint satisfaction problems using database techniques
• Characterising tractable constraints
• Title not available (Why is that?)
• The hardest constraint problems: A double phase transition
• Title not available (Why is that?)
• Locating the phase transition in binary constraint satisfaction problems
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• An optimal k-consistency algorithm
• An exact algorithm for the constraint satisfaction problem: Application to logical inference
• Constraint satisfaction from a deductive viewpoint
• Synthesizing constraint expressions
• Using constraint metaknowledge to reduce arc consistency computation
• Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
• Parallel problem solving from nature -- PPSN III. International conference on evolutionary computation. The 3rd conference, Jerusalem, Israel, October 9--14, 1994. Proceedings
• Title not available (Why is that?)

Cited In (25)

• Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers.
• Constraint updating
• Title not available (Why is that?)
• Experimental complexity analysis of continuous constraint satisfaction problems.
• A synthesis of constraint satisfaction and constraint solving
• Revisiting global constraint satisfaction
• The complexity of constraint satisfaction revisited
• Title not available (Why is that?)
• Constraint satisfaction from a deductive viewpoint
• A note on domination 3-edge-critical planar graphs
• Local consistency for extended CSPs
• The complexity of reasoning with global constraints
• On the complexity of trial and error for constraint satisfaction problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recent Advances in Constraints
• Fine-grained conflict resolution in constraint satisfaction problems
• Constraint Satisfaction Parameterized by Solution Size
• Polynomial time termination and constraint satisfaction tests
• The logic of constraint satisfaction
• Title not available (Why is that?)
• Solution techniques for constraint satisfaction problems: Advanced approaches
• Constraint satisfaction problem with bilevel constraint: Application to interpretation of over-segmented images
• The complexity of constraint satisfaction problems for small relation algebras
• Algorithms and Computation

This page was built for publication: Constraint satisfaction -- algorithms and complexity analysis

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