Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
暂无分享,去创建一个
[1] Mihalis Yannakakis,et al. Algorithms for Acyclic Database Schemes , 1981, VLDB.
[2] Catriel Beeri,et al. On the Desirability of Acyclic Database Schemes , 1983, JACM.
[3] Fan Chung Graham,et al. Some intersection theorems for ordered sets and graphs , 1986, J. Comb. Theory, Ser. A.
[4] Nikolai K. Vereshchagin,et al. Partitioning multi-dimensional sets in a small number of "uniform" parts , 2005, Eur. J. Comb..
[5] Rolf Niedermeier,et al. INTRODUCTION TO FIXED-PARAMETER ALGORITHMS , 2006 .
[6] Marc Gyssens,et al. Closure properties of constraints , 1997, JACM.
[7] Dan Suciu,et al. Journal of the ACM , 2006 .
[8] Francesco Scarcello,et al. The power of tree projections: local consistency, greedy algorithms, and larger islands of tractability , 2010, PODS '10.
[9] 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..
[10] Anand Rajaraman,et al. Conjunctive query containment revisited , 1997, Theor. Comput. Sci..
[11] Dániel Marx. Tractable Structures for Constraint Satisfaction with Truth Tables , 2009, Theory of Computing Systems.
[12] Dániel Marx,et al. Constraint solving via fractional edge covers , 2006, SODA '06.
[13] Mihai Patrascu,et al. On the possibility of faster SAT algorithms , 2010, SODA '10.
[14] Hubie Chen,et al. Constraint satisfaction with succinctly specified relations , 2010, J. Comput. Syst. Sci..
[15] Rolf Niedermeier,et al. Invitation to Fixed-Parameter Algorithms , 2006 .
[16] Georg Gottlob,et al. Fixed-parameter complexity in AI and nonmonotonic reasoning , 1999, Artif. Intell..
[17] Dániel Marx,et al. Approximating fractional hypertree width , 2009, TALG.
[18] Ashok K. Chandra,et al. Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.
[19] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[20] Catriel Beeri,et al. Properties of acyclic database schemes , 1981, STOC '81.
[21] Georg Gottlob,et al. Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems , 2007, Comput. J..
[22] Mohammad Taghi Hajiaghayi,et al. An O(sqrt(n))-approximation algorithm for directed sparsest cut , 2006, Inf. Process. Lett..
[23] Paul D. Seymour,et al. Approximating clique-width and branch-width , 2006, J. Comb. Theory, Ser. B.
[24] Phokion G. Kolaitis,et al. Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics , 2002, CP.
[25] Geoff Whittle,et al. Matroid tree-width , 2006, Eur. J. Comb..
[26] Satoru Iwata,et al. Submodular function minimization , 2007, Math. Program..
[27] Satoru Iwata,et al. A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.
[28] Paul D. Seymour,et al. Testing branch-width , 2007, J. Comb. Theory, Ser. B.
[29] Peter Jeavons,et al. The complexity of maximal constraint languages , 2001, STOC '01.
[30] Andrei A. Bulatov,et al. Tractable conservative constraint satisfaction problems , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..
[31] Russell Impagliazzo,et al. Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[32] Ronald Fagin,et al. Degrees of acyclicity for hypergraphs and relational database schemes , 1983, JACM.
[33] Dániel Marx,et al. Can you beat treewidth? , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[34] Martin Grohe. The Structure of Tractable Constraint Satisfaction Problems , 2006, MFCS.
[35] Georg Gottlob,et al. Hypertree decompositions and tractable queries , 1998, PODS '99.
[36] Martin Grohe. The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2007, JACM.
[37] Georg Gottlob,et al. Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning , 1999, LPNMR.
[38] Noga Alon,et al. Improved approximation for directed cut problems , 2007, STOC '07.
[39] 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..
[40] Petr Hlinený,et al. A Parametrized Algorithm for Matroid Branch-Width , 2005, SIAM J. Comput..
[41] Alexandr Andoni,et al. On the Optimality of the Dimensionality Reduction Method , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[42] Andrei A. Bulatov,et al. Complexity of conservative constraint satisfaction problems , 2011, TOCL.
[43] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[44] Georg Gottlob,et al. Hypertree width and related hypergraph invariants , 2007, Eur. J. Comb..
[45] Nicolas Nisse,et al. Submodular partition functions , 2009, Discret. Math..
[46] Phokion G. Kolaitis,et al. A Game-Theoretic Approach to Constraint Satisfaction , 2000, AAAI/IAAI.
[47] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[48] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[49] Andrei A. Bulatov,et al. A dichotomy theorem for constraint satisfaction problems on a 3-element set , 2006, JACM.
[50] W. Marsden. I and J , 2012 .
[51] Alexander Schrijver,et al. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.
[52] 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..
[53] Georg Gottlob,et al. Uniform Constraint Satisfaction Problems and Database Theory , 2008, Complexity of Constraints.
[54] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[55] Eugene C. Freuder. Complexity of K-Tree Structured Constraint Satisfaction Problems , 1990, AAAI.
[56] Dániel Marx,et al. On the Optimality of Planar and Geometric Approximation Schemes , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[57] Sang-il Oum,et al. Approximating rank-width and clique-width quickly , 2005, TALG.
[58] Dániel Marx,et al. On tree width, bramble size, and expansion , 2009, J. Comb. Theory, Ser. B.
[59] Phokion G. Kolaitis,et al. Conjunctive-query containment and constraint satisfaction , 1998, PODS.
[60] Petr Hliněný,et al. Matroid tree-width , 2006 .
[61] M. Hajiaghayi,et al. An O ( √ n )-Approximation Algorithm For Directed Sparsest Cut , 2005 .
[62] Anupam Gupta. Improved results for directed multicut , 2003, SODA '03.
[63] Petr Hlinený,et al. Finding Branch-Decompositions and Rank-Decompositions , 2007, SIAM J. Comput..
[64] Andrei A. Bulatov,et al. On the Power of k -Consistency , 2007, ICALP.