Limit Behavior of Locally Consistent Constraint Satisfaction Problems

DOI10.1137/060667591MaRDI QIDQ3094950zbMATH OpenOpenAlexWikidataFDO

Authors Manuel Bodirsky, Daniel Král'

Publication date 27 October 2011

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/060667591

zbMATH Keywords

constraint satisfaction problem (CSP)local consistency

Mathematics Subject Classification ID

Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Combinatorics in computer science (68R05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Automata, Languages and Programming
• Locally finite constraint satisfaction problems
• Locally consistent constraint satisfaction problems
• Constraint Satisfaction Problems Solvable by Local Consistency Methods
• Graph-Theoretic Concepts in Computer Science
• Mathematical Foundations of Computer Science 2005
• scientific article; zbMATH DE number 1396560
• Approximability of constrained LCS
• Approximability of constrained LCS
• The approximability of constraint satisfaction problems

Cited in

(7)

• Homogenization of parabolic equations with an arbitrary number of scales in both space and time
• Locally consistent constraint satisfaction problems
• Constraint Satisfaction Problems Solvable by Local Consistency Methods
• On the Power of k-Consistency
• Automata, Languages and Programming
• Mathematical Foundations of Computer Science 2005
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Limit Behavior of Locally Consistent Constraint Satisfaction Problems

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