Complexity of constraints. An overview of current research themes

DOI10.1007/978-3-540-92800-3zbMath1154.68008OpenAlexW2504838369MaRDI QIDQ2377603

No author found.

Publication date: 20 January 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92800-3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

A topological characterisation of endomorphism monoids of countable structures ⋮ Tractability in constraint satisfaction problems: a survey ⋮ The Complexity of General-Valued CSPs ⋮ Towards a characterization of constant-factor approximable finite-valued CSPs ⋮ The complexity of problems for quantified constraints ⋮ The Complexity of Valued CSPs ⋮ Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight ⋮ Topological Birkhoff ⋮ Partial Polymorphisms and Constraint Satisfaction Problems ⋮ Characterizations of several Maltsev conditions. ⋮ Generalising unit-refutation completeness and SLUR via nested input resolution ⋮ Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems ⋮ Distance constraint satisfaction problems

This page was built for publication: Complexity of constraints. An overview of current research themes