A Join-Based Hybrid Parameter for Constraint Satisfaction
暂无分享,去创建一个
[1] Dániel Marx,et al. Approximating fractional hypertree width , 2009, TALG.
[2] Georg Gottlob,et al. Hypertree decompositions and tractable queries , 1998, PODS '99.
[3] P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .
[4] Joakim Alme Nordstrand. Exploring graph parameters similar to tree-width and path-width , 2017 .
[5] Meikel Pöss,et al. Of Snowstorms and Bushy Trees , 2014, Proc. VLDB Endow..
[6] Stefan Szeider,et al. An SMT Approach to Fractional Hypertree Width , 2018, CP.
[7] Yannis E. Ioannidis,et al. Left-deep vs. bushy trees: an analysis of strategy spaces and its implications for query optimization , 1991, SIGMOD '91.
[8] Philippe David,et al. Using Pivot Consistency to Decompose and Solve Functional CSPs , 1994, J. Artif. Intell. Res..
[9] Martin Grohe,et al. Logic, graphs, and algorithms , 2007, Logic and Automata.
[10] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[11] Michael R. Fellows,et al. Review of: Fundamentals of Parameterized Complexity by Rodney G. Downey and Michael R. Fellows , 2015, SIGA.
[12] Georg Gottlob,et al. Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems , 2007, Comput. J..
[13] Dan Suciu,et al. What Do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog Have to Do with One Another? , 2016, PODS.
[14] Paul D. Seymour,et al. Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.
[15] Georg Gottlob,et al. General and Fractional Hypertree Decompositions: Hard and Easy Cases , 2016, AMW.
[16] Reinhard Diestel,et al. Graph Minors I: A Short Proof of the Path-width Theorem , 1995, Combinatorics, Probability and Computing.
[17] Dániel Marx. Tractable Structures for Constraint Satisfaction with Truth Tables , 2009, STACS.
[18] Mihalis Yannakakis,et al. Algorithms for Acyclic Database Schemes , 1981, VLDB.
[19] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.
[20] Pascal Van Hentenryck,et al. An Efficient Arc Consistency Algorithm for a Class of CSP Problems , 1991, IJCAI.
[21] Michael Alekhnovich,et al. Satisfiability, Branch-Width and Tseitin tautologies , 2011, computational complexity.
[22] Reinhard Diestel,et al. Graph Theory, 4th Edition , 2012, Graduate texts in mathematics.
[23] Martin C. Cooper,et al. On Guaranteeing Polynomially Bounded Search Tree Size , 2011, International Conference on Principles and Practice of Constraint Programming.
[24] Wady Naanaa. Unifying and extending hybrid tractable classes of CSPs , 2013, J. Exp. Theor. Artif. Intell..
[25] Atri Rudra,et al. FAQ: Questions Asked Frequently , 2015, PODS.
[26] Martin Grohe,et al. Parameterized complexity for the database theorist , 2002, SGMD.
[27] Robin Thomas,et al. Call routing and the ratcatcher , 1994, Comb..
[28] Martin C. Cooper,et al. Hybrid Tractable Classes of Constraint Problems , 2017, The Constraint Satisfaction Problem.
[29] Martin Grohe,et al. The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[30] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[31] Russell Impagliazzo,et al. Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..
[32] Peter Jeavons,et al. Classifying the Complexity of Constraints Using Finite Algebras , 2005, SIAM J. Comput..
[33] Martin C. Cooper,et al. Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems , 2016, Artif. Intell..
[34] Fabrizio Grandoni,et al. Resilient dictionaries , 2009, TALG.
[35] Dániel Marx,et al. Size Bounds and Query Plans for Relational Joins , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[36] Suresh Jagannathan,et al. CompCertTSO: A Verified Compiler for Relaxed-Memory Concurrency , 2013, JACM.
[37] Martin Grohe,et al. Constraint solving via fractional edge covers , 2006, SODA 2006.
[38] B. Mohar,et al. Graph Minors , 2009 .
[39] Martin C. Cooper,et al. Binary Constraint Satisfaction Problems Defined by Excluded Topological Minors , 2019, Inf. Comput..