How to determine the expressive power of constraints
From MaRDI portal
Publication:1300288
DOI10.1023/A:1009890709297zbMath0951.68190OpenAlexW1565722675MaRDI QIDQ1300288
Marc Gyssens, Peter G. Jeavons, David A. Cohen
Publication date: 7 September 1999
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009890709297
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)
Related Items (7)
The Expressive Power of Valued Constraints: Hierarchies and Collapses ⋮ The complexity of soft constraint satisfaction ⋮ On the Computational Complexity of Non-Dictatorial Aggregation ⋮ Constraint Satisfaction Parameterized by Solution Size ⋮ The expressive power of valued constraints: Hierarchies and collapses ⋮ Recognizing frozen variables in constraint satisfaction problems ⋮ Unnamed Item
This page was built for publication: How to determine the expressive power of constraints
