论文信息 - Distance Constraint Satisfaction Problems - 字舞流文

Distance Constraint Satisfaction Problems

Barnaby Martin | Michael Pinsker | Manuel Bodirsky | Víctor Dalmau

[1] Omer Reingold,et al. Undirected ST-connectivity in log-space , 2005, STOC '05.

[2] Peter Jeavons,et al. Classifying the Complexity of Constraints Using Finite Algebras , 2005, SIAM J. Comput..

[3] Marc Gyssens,et al. Closure properties of constraints , 1997, JACM.

[4] Jaroslav Nesetril,et al. Constraint Satisfaction with Countable Homogeneous Templates , 2003, J. Log. Comput..

[5] Manuel Bodirsky,et al. Non-dichotomies in Constraint Satisfaction Complexity , 2008, ICALP.

[6] Barnaby Martin,et al. On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction , 2010, LICS.

[7] Jaroslav Nesetril,et al. On the complexity of H-coloring , 1990, J. Comb. Theory, Ser. B.

[8] Michael Pinsker,et al. The reducts of equality up to primitive positive interdefinability , 2010, J. Symb. Log..

[9] Manuel Bodirsky,et al. The complexity of temporal constraint satisfaction problems , 2010, JACM.

[10] Tomás Feder,et al. The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..