Locally consistent constraint satisfaction problems
From MaRDI portal
Publication:2581264
DOI10.1016/j.tcs.2005.09.012zbMath1081.68094OpenAlexW1987078671WikidataQ57601563 ScholiaQ57601563MaRDI QIDQ2581264
Daniel Král', Zdeněk Dvořák, Ondřej Pangrác
Publication date: 9 January 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.012
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of partial satisfaction. II.
- A guided tour of Chernoff bounds
- Implications of forbidden structures for extremal algorithmic problems
- Local and global relational consistency
- A sharp threshold for a random constraint satisfaction problem
- Complexity of Partial Satisfaction
- A Sufficient Condition for Backtrack-Free Search
- On the Approximation of Maximum Satisfiability
- On Local Versus Global Satisfiability
- Worst-case time bounds for coloring and satisfiability problems
- Max-Min Probabilities in the Voting Paradox
- The complexity of satisfiability problems
- Some optimal inapproximability results
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Locally consistent constraint satisfaction problems
