Distance constraint satisfaction problems
Bodirsky, Manuel, Dalmau, Victor, Martin, Barnaby and Pinsker, Michael (2010) Distance constraint satisfaction problems. Mathematical Foundations of Computer Science 2010. In: 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010), 23-27 August 2010, Brno, Czech Republic. ISBN 9783642151545. ISSN 0302-9743 [Conference or Workshop Item] (doi:10.1007/978-3-642-15155-2_16)
Abstract
We study the complexity of constraint satisfaction problems for templates Γ that are first-order definable in (Z;suc) , the integers with the successor relation. Assuming a widely believed conjecture from finite domain constraint satisfaction (we require the tractability conjecture by Bulatov, Jeavons and Krokhin in the special case of transitive finite templates), we provide a full classification for the case that Γ is locally finite (i.e., the Gaifman graph of Γ has finite degree). We show that one of the following is true: The structure Γ is homomorphically equivalent to a structure with a certain majority polymorphism (which we call modular median) and CSP (Γ) can be solved in polynomial time, or Γ is homomorphically equivalent to a finite transitive structure, or CSP (Γ) is NP-complete.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Research Areas: | A. > School of Science and Technology > Computer Science A. > School of Science and Technology > Computer Science > Foundations of Computing group |
| Item ID: | 9684 |
| Useful Links: | |
| Depositing User: | Devika Mohan |
| Date Deposited: | 16 Jan 2013 08:47 |
| Last Modified: | 24 Apr 2018 15:15 |
| URI: | https://eprints.mdx.ac.uk/id/eprint/9684 |
Actions (login required)
 |
View Item |
Statistics
Additional statistics are available via IRStats2.
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)