Strong computational lower bounds via parameterized complexity
暂无分享,去创建一个
Ge Xia | Jianer Chen | Xiuzhen Huang | Iyad A. Kanj | Jianer Chen | Ge Xia | Xiuzhen Huang
[1] Jianer Chen. Characterizing Parallel Hierarchies by Reducibilities , 1991, Inf. Process. Lett..
[2] Ge Xia,et al. Tight lower bounds for certain parameterized NP-hard problems , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[3] Richard Beigel,et al. Finding maximum independent sets in sparse and general graphs , 1999, SODA '99.
[4] Svatopluk Poljak,et al. On the complexity of the subgraph problem , 1985 .
[5] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[6] Mihalis Yannakakis,et al. On the Complexity of Database Queries , 1999, J. Comput. Syst. Sci..
[7] Leslie E. Trotter,et al. Vertex packings: Structural properties and algorithms , 1975, Math. Program..
[8] Michael R. Fellows,et al. Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems , 2003, CATS.
[9] Liming Cai,et al. On Fixed-Parameter Tractability and Approximability of NP Optimization Problems , 1997, J. Comput. Syst. Sci..
[10] Rolf Niedermeier,et al. On Exact and Approximation Algorithms for Distinguishing Substring Selection , 2003, FCT.
[11] Bin Ma,et al. Genetic Design of Drugs Without Side-Effects , 2003, SIAM J. Comput..
[12] R. Steele. Optimization , 2005 .
[13] Ge Xia,et al. Linear FPT reductions and computational lower bounds , 2004, STOC '04.
[14] Mihalis Yannakakis,et al. On limited nondeterminism and the complexity of the V-C dimension , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[15] Uriel Feige,et al. On Limited versus Polynomial Nondeterminism , 1997, Chic. J. Theor. Comput. Sci..
[16] Ulrike Stege,et al. Solving large FPT problems on coarse-grained parallel machines , 2003, J. Comput. Syst. Sci..
[17] Weijia Jia,et al. Vertex Cover: Further Observations and Further Improvements , 2001, J. Algorithms.
[18] Rolf Niedermeier,et al. Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs , 2002, Algorithmica.
[19] Rolf Niedermeier,et al. Upper Bounds for Vertex Cover Further Improved , 1999, STACS.
[20] Don Coppersmith,et al. Matrix multiplication via arithmetic progressions , 1987, STOC.
[21] Robert E. Tarjan,et al. Finding a Maximum Independent Set , 1976, SIAM J. Comput..
[22] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[23] Michael R. Fellows,et al. Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues , 1995, Ann. Pure Appl. Log..
[24] Michael R. Fellows,et al. Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT , 2003, WG.
[25] Liming Cai,et al. On the existence of subexponential parameterized algorithms , 2003, J. Comput. Syst. Sci..
[26] Bin Ma,et al. A PTAS for Distinguishing (Sub)string Selection , 2002, ICALP.
[27] Tang Jian,et al. An O(20.304n) Algorithm for Solving Maximum Independent Set Problem , 1986, IEEE Trans. Computers.
[28] Giorgio Gambosi,et al. Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .
[29] John Michael Robson,et al. Algorithms for Maximum Independent Sets , 1986, J. Algorithms.
[30] Russell Impagliazzo,et al. Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).