On Guaranteeing Polynomially Bounded Search Tree Size

[1]  Mats Carlsson,et al.  Global Constraint Catalog, 2nd Edition , 2010 .

[2]  Martin C. Cooper,et al.  Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination , 2010, Artif. Intell..

[3]  Peter Jeavons,et al.  Perfect Constraints Are Tractable , 2008, CP.

[4]  Dániel Marx,et al.  Constraint solving via fractional edge covers , 2006, SODA '06.

[5]  Martin Grohe,et al.  The Structure of Tractable Constraint Satisfaction Problems , 2006, MFCS.

[6]  Rastislav Královič,et al.  Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings , 2006, MFCS.

[7]  Stefan Szeider,et al.  Backdoor Sets for DLL Subsolvers , 2005, Journal of Automated Reasoning.

[8]  Nicolas Beldiceanu,et al.  Global Constraint Catalog , 2005 .

[9]  Bart Selman,et al.  Backdoors To Typical Case Complexity , 2003, IJCAI.

[10]  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..

[11]  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..

[12]  Marc Gyssens,et al.  A test for Tractability , 1996, CP.

[13]  Chi-Kwong Li,et al.  A research problem , 1996 .

[14]  Philippe David,et al.  Using Pivot Consistency to Decompose and Solve Functional CSPs , 1994, J. Artif. Intell. Res..

[15]  P. David.  Prise en compte de la sémantique dans les problèmes de satisfaction de contraintes : étude des contraintes fonctionnelles , 1994 .

[16]  Philippe Jégou.  Decomposition of Domains Based on the Micro-Structure of Finite Constraint-Satisfaction Problems , 1993, AAAI.

[17]  Pascal Van Hentenryck,et al.  An Efficient Arc Consistency Algorithm for a Class of CSP Problems , 1991, IJCAI.

[18]  A. Sidorenko,et al.  Precise values of turan numbers , 1987 .

[19]  József Dénes,et al.  Research problems , 1980, Eur. J. Comb..

[20]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[21]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.