On Problems as Hard as CNF-SAT
暂无分享,去创建一个
Yoshio Okamoto | Dániel Marx | Saket Saurabh | Magnus Wahlström | Marek Cygan | Daniel Lokshtanov | Ramamohan Paturi | Holger Dell | Jesper Nederlof
[1] Russell Impagliazzo,et al. Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..
[2] Jesper Nederlof. Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems , 2009, ICALP.
[3] Richard Bellman,et al. Dynamic Programming Treatment of the Travelling Salesman Problem , 1962, JACM.
[4] Leslie G. Valiant,et al. Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.
[5] Fabrizio Grandoni,et al. A measure & conquer approach for the analysis of exact algorithms , 2009, JACM.
[6] Ryan Williams. Nonuniform ACC Circuit Lower Bounds , 2014, JACM.
[7] Dániel Marx,et al. Slightly superexponential parameterized problems , 2011, SODA '11.
[8] Ryan Williams,et al. Non-uniform ACC Circuit Lower Bounds , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[9] Michal Pilipczuk,et al. Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[10] Johan M. M. van Rooij. Exact Exponential-Time Algorithms for Domination Problems in Graphs , 2011 .
[11] Thomas C. van Dijk,et al. Inclusion/Exclusion Meets Measure and Conquer , 2009, ESA.
[12] John Michael Robson,et al. Algorithms for Maximum Independent Sets , 1986, J. Algorithms.
[13] Chris Calabro. A Lower Bound on the Size of Series-Parallel Graphs Dense in Long Paths , 2008, Electron. Colloquium Comput. Complex..
[14] Ge Xia,et al. Tight lower bounds for certain parameterized NP-hard problems , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[15] Johan M. M. van Rooij,et al. Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting , 2010, IPEC.
[16] Emanuele Viola,et al. On the Power of Small-Depth Computation , 2009, Found. Trends Theor. Comput. Sci..
[17] Thomas C. van Dijk,et al. Inclusion/Exclusion Meets Measure and Conquer , 2013, Algorithmica.
[18] Avi Wigderson,et al. Extractors and Rank Extractors for Polynomial Sources , 2007, FOCS.
[19] Joachim Kneis,et al. A Fine-grained Analysis of a Simple Independent Set Algorithm , 2009, FSTTCS.
[20] Gerhard J. Woeginger,et al. Exact (Exponential) Algorithms for the Dominating Set Problem , 2004, WG.
[21] Rahul Santhanam,et al. On the Limits of Sparsification , 2012, ICALP.
[22] Russell Impagliazzo,et al. On the Complexity of k-SAT , 2001, J. Comput. Syst. Sci..
[23] Russell Impagliazzo,et al. The Complexity of Satisfiability of Small Depth Circuits , 2009, IWPEC.
[24] Rainer Schuler,et al. An algorithm for the satisfiability problem of formulas in conjunctive normal form , 2005, J. Algorithms.
[25] Russell Impagliazzo,et al. The complexity of unique k-SAT: an isolation lemma for k-CNFs , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[26] Andreas Björklund,et al. Set Partitioning via Inclusion-Exclusion , 2009, SIAM J. Comput..
[27] Andreas Björklund,et al. Fourier meets möbius: fast subset convolution , 2006, STOC '07.
[28] Dániel Marx,et al. Exponential Time Complexity of the Permanent and the Tutte Polynomial , 2010, TALG.
[29] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.
[30] Russell Impagliazzo,et al. A duality between clause width and clause density for SAT , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).
[31] Patrick Traxler. The Time Complexity of Constraint Satisfaction , 2008, IWPEC.
[32] 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).