Classifying the Complexity of Constraints Using Finite Algebras
暂无分享,去创建一个
[1] Martin C. Cooper,et al. Characterising Tractable Constraints , 1994, Artif. Intell..
[2] D. Hobby,et al. The structure of finite algebras , 1988 .
[3] Peter Jeavons,et al. Tractable constraints closed under a binary operation , 2000 .
[4] Peter Jeavons,et al. Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra , 2003, JACM.
[5] 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..
[6] Peter Jeavons,et al. Building tractable disjunctive constraints , 2000, J. ACM.
[7] 室 章治郎. Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 , 1980 .
[8] Peter Jeavons,et al. A Survey of Tractable Constraint Satisfaction Problems , 1997 .
[9] Jaroslav Nesetril,et al. Constraint Satisfaction with Countable Homogeneous Templates , 2003, J. Log. Comput..
[10] Marc Gyssens,et al. Closure properties of constraints , 1997, JACM.
[11] Christos H. Papadimitriou,et al. Computational complexity , 1993 .
[12] Alan K. Mackworth. Consistency in Networks of Relations , 1977, Artif. Intell..
[13] Rina Dechter,et al. Network-based heuristics for constraint satisfaction problems , 1988 .
[14] Bernhard Nebel,et al. Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra , 1994, JACM.
[15] Reinhard Pöschel,et al. Funktionen- und Relationenalgebren , 1979 .
[16] Marc Gyssens,et al. Decomposing Constraint Satisfaction Problems Using Database Techniques , 1994, Artif. Intell..
[17] Georg Gottlob,et al. A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.
[18] Justin Pearson,et al. Closure Functions and Width 1 Problems , 1999, CP.
[19] Andrei A. Bulatov,et al. A dichotomy theorem for constraints on a three-element set , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[20] Peter Jeavons. Constructing Constraints , 1998, CP.
[21] Andrei A. Bulatov,et al. Tractable conservative constraint satisfaction problems , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..
[22] Martin C. Cooper,et al. Tractable Constraints on Ordered Domains , 1995, Artif. Intell..
[23] Marc Gyssens,et al. A Unifying Framework for Tractable Constraints , 1995, CP.
[24] Ugo Montanari,et al. Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..
[25] George Gratzer,et al. Universal Algebra , 1979 .
[26] P. J. Higgins. UNIVERSAL ALGEBRA: (Mathematics and its Applications, 6) , 1982 .
[27] Desmond Fearnley-Sander,et al. Universal Algebra , 1982 .
[28] Jaroslav Nesetril,et al. On the complexity of H-coloring , 1990, J. Comb. Theory, Ser. B.
[29] Sanjeev Khanna,et al. Complexity classifications of Boolean constraint satisfaction problems , 2001, SIAM monographs on discrete mathematics and applications.
[30] Peter Jonsson,et al. A Complete Classification of Tractability in Allen's Algebra Relative to Subsets of Basic Relations , 1998, Artif. Intell..
[31] Eugene C. Freuder,et al. The Complexity of Constraint Satisfaction Revisited , 1993, Artif. Intell..
[32] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[33] Víctor Dalmau,et al. Constraint Satisfaction Problems in Non-deterministic Logarithmic Space , 2002, ICALP.
[34] Lefteris M. Kirousis. Fast Parallel Constraint Satisfaction , 1993, ICALP.
[35] Pavol Hell,et al. List Homomorphisms and Circular Arc Graphs , 1999, Comb..
[36] Peter B. Ladkin,et al. On binary constraint problems , 1994, JACM.
[37] Wolfgang Bibel,et al. Constraint Satisfaction from a Deductive Viewpoint , 1988, Artif. Intell..
[38] Phokion G. Kolaitis,et al. Conjunctive-Query Containment and Constraint Satisfaction , 2000, J. Comput. Syst. Sci..
[39] Víctor Dalmau,et al. A new tractable class of constraint satisfaction problems , 2005, Annals of Mathematics and Artificial Intelligence.
[40] Tomás Feder. Constraint Satisfaction on Finite Groups with Near Subgroups , 2005, Electron. Colloquium Comput. Complex..
[41] Paul Walker,et al. Engineering Dynamic Scheduler for Work Manager , 1998 .
[42] Á. Szendrei. Term minimal algebras , 1994 .
[43] Peter Jeavons,et al. Constraint Tractability Theory And Its Application to the Product Development Process for a Constraint−Based Scheduler , 1999 .
[44] Martin C. Cooper,et al. Constraints, Consistency and Closure , 1998, Artif. Intell..
[45] Andrei A. Bulatov,et al. Mal'tsev constraints are tractable , 2002, Electron. Colloquium Comput. Complex..
[46] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[47] Nicholas Pippenger. Theories of computability , 1997 .
[48] Ágnes Szendrei,et al. Clones in universal algebra , 1986 .
[49] R. Tennant. Algebra , 1941, Nature.
[50] Alan K. Mackworth. Constraint Satisfaction , 1985 .
[51] Justin Pearson,et al. Constraints and universal algebra , 1998, Annals of Mathematics and Artificial Intelligence.
[52] Emil L. Post. The two-valued iterative systems of mathematical logic , 1942 .
[53] Á. Szendrei. Simple surjective algebras having no proper subalgebras , 1990 .
[54] Bernhard Nebel,et al. On the Complexity of Qualitative Spatial Reasoning: A Maximal Tractable Fragment of the Region Connection Calculus , 1999, Artif. Intell..
[55] Peter Jeavons,et al. On the Algebraic Structure of Combinatorial Problems , 1998, Theor. Comput. Sci..
[56] Klaus Denecke,et al. Universal Algebra and Applications in Theoretical Computer Science , 2018 .
[57] Peter van Beek,et al. On the minimality and global consistency of row-convex constraint networks , 1995, JACM.
[58] Peter Jeavons,et al. The complexity of maximal constraint languages , 2001, STOC '01.