On Existential MSO and Its Relation to ETH
暂无分享,去创建一个
[1] David S. Johnson,et al. What are the least tractable instances of max independent set? , 1999, SODA '99.
[2] Ge Xia,et al. Strong computational lower bounds via parameterized complexity , 2006, J. Comput. Syst. Sci..
[3] Ronald Fagin,et al. Monadic generalized spectra , 1975, Math. Log. Q..
[4] Ronald Fagin,et al. On Winning Strategies in Ehrenfeucht-Fraïssé Games , 1997, Theor. Comput. Sci..
[5] Margaret B. Cozzens,et al. Dominating cliques in graphs , 1991, Discret. Math..
[6] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[7] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[8] Bruno Courcelle,et al. Graph Operations and Monadic Second-Order Logic: A Survey , 2000, LPAR.
[9] Russell Impagliazzo,et al. A duality between clause width and clause density for SAT , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).
[10] Russell Impagliazzo,et al. Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[11] Marvin Künnemann,et al. Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[12] Dieter van Melkebeek,et al. Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses , 2010, STOC '10.
[13] Ronald Fagin,et al. On Monadic NP vs. Monadic co-NP , 1995, Inf. Comput..
[14] Ge Xia,et al. On Parameterized Exponential Time Complexity , 2009, TAMC.
[15] 室 章治郎. 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 .
[16] Dániel Marx,et al. Can you beat treewidth? , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[17] Leonid Libkin,et al. Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.
[18] Carsten Sinz,et al. Towards an Optimal CNF Encoding of Boolean Cardinality Constraints , 2005, CP.
[19] Bruno Courcelle,et al. Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , 2012, Encyclopedia of mathematics and its applications.
[20] Lutz Volkmann,et al. Distance Domination and Distance Irredundance in Graphs , 2007, Electron. J. Comb..
[21] Paul Cull,et al. Error-correcting codes on the towers of Hanoi graphs , 1999, Discret. Math..
[22] Jerzy Marcinkowski,et al. A Toolkit for First Order Extensions of Monadic Games , 2001, STACS.
[23] Fedor V. Fomin,et al. On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms , 2008, Algorithmica.
[24] Ronald Fagin,et al. Reachability is harder for directed than for undirected finite graphs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[25] Jon M. Kleinberg,et al. A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search , 2002, Theor. Comput. Sci..
[26] Piotr Indyk,et al. Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) , 2014, STOC.
[27] Michal Pilipczuk,et al. Lower bounds for approximation schemes for Closest String , 2015, SWAT.
[28] Evgeny Dantsin,et al. On Moderately Exponential Time for SAT , 2010, SAT.
[29] R. L. Brooks. On colouring the nodes of a network , 1941, Mathematical Proceedings of the Cambridge Philosophical Society.
[30] Ronald Fagin. Comparing the Power of Monadic NP Games , 1994, LCC.
[31] Sheung-Hung Poon,et al. Domatic Partition on Several Classes of Graphs , 2012, COCOA.
[32] Neil Immerman,et al. Descriptive Complexity , 1999, Graduate Texts in Computer Science.
[33] Amir Abboud,et al. Tight Hardness Results for LCS and Other Sequence Similarity Measures , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[34] Martin Grohe,et al. Parameterized Complexity and Subexponential Time , 2004 .
[35] Jakub W. Pachocki,et al. Tight Bounds for Graph Homomorphism and Subgraph Isomorphism , 2016, SODA.
[36] Elena Pezzoli,et al. Computational Complexity of Ehrenfeucht-Fraïssé Games on Finite Structures , 1998, CSL.
[37] Ronald Fagin. Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .
[38] Ge Xia,et al. Tight lower bounds for certain parameterized NP-hard problems , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[39] Fedor V. Fomin,et al. Exact exponential algorithms , 2013, CACM.
[40] Karl Bringmann,et al. Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[41] Santosh S. Vempala,et al. Algorithms for implicit hitting set problems , 2011, SODA '11.
[42] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[43] Detlef Seese,et al. Monadic NP and Graph Minors , 1998, CSL.
[44] Thomas Schwentick,et al. On Winning Ehrenfeucht Games and Monadic NP , 1996, Ann. Pure Appl. Log..
[45] Stefan Szeider,et al. Parameterized and subexponential-time complexity of satisfiability problems and applications , 2015, Theor. Comput. Sci..
[46] Ronald Fagin,et al. The Closure of Monadic NP , 2000, J. Comput. Syst. Sci..
[47] Dániel Marx,et al. Lower bounds based on the Exponential Time Hypothesis , 2011, Bull. EATCS.