Constraint satisfaction -- algorithms and complexity analysis
type: Item
instance of: scholarly article
title: Constraint satisfaction -- algorithms and complexity analysis
zbMATH Open document ID: 1051.68545
DOI: 10.1016/0020-0190(95)00089-U
author: Walter Hower
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 984733
zbMATH Keywords: Analysis and design of algorithms
zbMATH Keywords: Combinatorial problems
zbMATH Keywords: Computational complexity
zbMATH Keywords: Constraint satisfaction
MaRDI profile type: Publication
cites work: An exact algorithm for the constraint satisfaction problem: Application to logical inference
cites work: Using constraint metaknowledge to reduce arc consistency computation
cites work: Constraint satisfaction from a deductive viewpoint
cites work: Q4012216
cites work: An optimal k-consistency algorithm
cites work: Characterising tractable constraints
cites work: Q4386933
cites work: From local to global consistency
cites work: Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
cites work: Synthesizing constraint expressions
cites work: Q4040797
cites work: Decomposing constraint satisfaction problems using database techniques
cites work: The hardest constraint problems: A double phase transition
cites work: Q3843153
cites work: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
cites work: Parallel problem solving from nature -- PPSN III. International conference on evolutionary computation. The 3rd conference, Jerusalem, Israel, October 9--14, 1994. Proceedings
cites work: Locating the phase transition in binary constraint satisfaction problems
full work available at URL: 0020-0190(95)00089-u
OpenAlex ID: W2053738200
description: scientific article; zbMATH DE number 984733