Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping
暂无分享,去创建一个
[1] Yijia Chen,et al. An Isomorphism Between Subexponential and Parameterized Complexity Theory , 2007, SIAM J. Comput..
[2] James W. Thatcher,et al. Generalized finite automata theory with an application to a decision problem of second-order logic , 1968, Mathematical systems theory.
[3] Venkatesh Raman,et al. Parameterized complexity of finding subgraphs with hereditary properties , 2000, Theor. Comput. Sci..
[4] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[5] John Doner,et al. Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..
[6] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[7] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[8] Michael R. Fellows,et al. Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues , 1995, Ann. Pure Appl. Log..
[9] Bas Luttik,et al. Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge , 2004, Log. Methods Comput. Sci..
[10] Jörg Flum,et al. Parametrized Complexity and Subexponential Time (Column: Computational Complexity) , 2004, Bull. EATCS.
[11] Martin Grohe,et al. The complexity of first-order and monadic second-order logic revisited , 2004, Ann. Pure Appl. Log..
[12] Jörg Flum,et al. Bounded fixed-parameter tractability and log2n nondeterministic bits , 2004, J. Comput. Syst. Sci..
[13] Iyad A. Kanj,et al. Tight lower bounds for certain parameterized NP-hard problems , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[14] Jörg Flum,et al. Model-checking problems as a basis for parameterized intractability , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..
[15] Mihalis Yannakakis,et al. On the Complexity of Database Queries , 1999, J. Comput. Syst. Sci..