Skip to main content
SpringerLink
Log in

Parameterized Complexity and Subexponential-Time Computability

  • Chapter
The Multivariate Algorithmic Revolution and Beyond

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7370))

Abstract

Since its inception in the 1990’s, parameterized complexity has established itself as one of the major research areas in theoretical computer science. Parameterized and kernelization algorithms have proved to be very useful for solving important problems in various domains of science and technology. Moreover, parameterized complexity has shown deep connections to traditional areas of theoretical computer science, such as structural complexity theory and approximation algorithms.

In this paper, we discuss some of the recent results pertaining to the relation between parameterized complexity and subexponential-time computability. We focus our attention on satisfiability problems because they play a key role in the definition of both parameterized complexity and structural complexity classes, and because they model numerous important problems in computer science.

This paper is dedicated to the 60th birthday of Michael R. Fellows. Many of the results examined in this paper were authored or co-authored by Michael, and those that were not, would probably never have existed without his efforts. If parameterized complexity would not have started without Michael, Rodney, and two bottles of 1989 Villa Maria Merlot/Cabarnet Sauvignon, then it definitely would not have flourished and matured into such an important area of theoretical computer science without Michael’s great ideas, efforts, and inspirations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abrahamson, K., Downey, R., Fellows, M.: Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues. Annals of Pure and Applied Logic 73(3), 235–276 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Alon, N., Yuster, R., Zwick, U.: Color-coding. Journal of the ACM 42, 844–856 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ausiello, G., Protasi, M., Marchetti-Spaccamela, A., Gambosi, G., Crescenzi, P., Kann, V.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, 1st edn. Springer-Verlag New York, Inc., Secaucus (1999)

    Book  MATH  Google Scholar 

  4. Björklund, A.: Determinant sums for undirected hamiltonicity. In: Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, pp. 173–182 (2010)

    Google Scholar 

  5. Brüggemann, T., Kern, W.: An improved deterministic local search algorithm for 3SAT. Theoretical Computer Science 329, 303–313 (2004)

    Article  MathSciNet  Google Scholar 

  6. Cai, L., Chen, J.: On the amount of nondeterminism and the power of verifying. SIAM Journal on Computing 26(3), 733–750 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cai, L., Chen, J., Håstad, J.: Circuit bottom fan-in and computational power. SIAM Journal on Computing 27(2), 341–355 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  8. Cai, L., Fellows, M., Juedes, D., Rosamond, F.: The complexity of polynomial-time approximation. Theory of Computing Systems 41(3), 459–477 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  9. Cai, L., Juedes, D.: On the existence of subexponential parameterized algorithms. Journal of Computer and System Sciences 67(4), 789–807 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  10. Calabro, C., Impagliazzo, R., Paturi, R.: A duality between clause width and clause density for SAT. In: IEEE Conference on Computational Complexity, pp. 252–260 (2006)

    Google Scholar 

  11. Chen, J.: Characterizing parallel hierarchies by reducibilities. Information Processing Letters 39(6), 303–307 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  12. Chen, J., Chor, B., Fellows, M., Huang, X., Juedes, D., Kanj, I., Xia, G.: Tight lower bounds for certain parameterized NP-hard problems. Information & Computation 201(2), 216–231 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Chen, J., Feng, Q., Liu, Y., Lu, S., Wang, J.: Improved deterministic algorithms for weighted matching and packing problems. Theoretical Computer Science 412(23), 2503–2512 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  14. Chen, J., Huang, X., Kanj, I., Xia, G.: Strong computational lower bounds via parameterized complexity. Journal of Computer and System Sciences 72(8), 1346–1367 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  15. Chen, J., Huang, X., Kanj, I., Xia, G.: Polynomial time approximation schemes and parameterized complexity. Discrete Applied Mathematics 155(2), 180–193 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  16. Chen, J., Kanj, I., Jia, W.: Vertex cover: further observations and further improvements. Journal of Algorithms 41, 280–301 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  17. Chen, J., Kanj, I., Xia, G.: On parameterized exponential time complexity. Theoretical Computer Science 410(27-29), 2641–2648 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  18. Chen, J., Kneis, J., Lu, S., Molle, D., Richter, S., Rossmanith, P., Sze, S.-H., Zhang, F.: Randomized divide-and-conquer: improved path, matching, and packing algorithms. SIAM Journal on Computing 38, 2526–2547 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  19. Chen, Y., Flum, J.: On miniaturized problems in parameterized complexity theory. Theoretical Computer Science 351(3), 314–336 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  20. Chen, Y., Flum, J.: Subexponential time and fixed-parameter tractability: Exploiting the miniaturization mapping. Journal of Logic and Computation 19(1), 89–122 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  21. Chen, Y., Grohe, M.: An isomorphism between subexponential and parameterized complexity theory. SIAM Journal on Computing 37(4), 1228–1258 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  22. Deng, X., Li, G., Li, Z., Ma, B., Wang, L.: Genetic design of drugs without side-effects. SIAM Journal on Computing 32, 1073–1090 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  23. Downey, R., Estivill-Castro, V., Fellows, M., Prieto-Rodriguez, E., Rosamond, F.: Cutting up is hard to do: the parameterized complexity of k-Cut and related problems. Electronic Notes in Theoretical Computer Science 78, 205–218 (2003)

    Article  MATH  Google Scholar 

  24. Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)

    Book  MATH  Google Scholar 

  25. Flum, J., Grohe, M.: Parametrized complexity and subexponential time (column: Computational complexity). Bulletin of the EATCS 84, 71–100 (2004)

    MATH  Google Scholar 

  26. Flüm, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2010)

    MATH  Google Scholar 

  27. Gramm, J., Guo, J., Niedermeier, R.: On Exact and Approximation Algorithms for Distinguishing Substring Selection. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol. 2751, pp. 195–209. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  28. Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for closest string and related problems. Algorithmica 37(1), 25–42 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  29. Håstad, J.: Computational limitations of small depth circuits. Technical report, MIT Press (1986)

    Google Scholar 

  30. Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. Journal of Computer and System Sciences 62(2), 367–375 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  31. Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? Journal of Computer and System Sciences 63(4), 512–530 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  32. Koutis, I.: Faster Algebraic Algorithms for Path and Packing Problems. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 575–586. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  33. Lokshtanov, D., Marx, D., Saurabh, S.: Slightly superexponential parameterized problems. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 760–776 (2011)

    Google Scholar 

  34. Marx, D.: Parameterized complexity and approximation algorithms. The Computer Journal 51(1), 60–78 (2008)

    Article  Google Scholar 

  35. Monien, B.: How to find long paths efficiently. Ann. Discrete Math. 25, 239–254 (1985)

    MathSciNet  MATH  Google Scholar 

  36. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, USA (2006)

    Book  MATH  Google Scholar 

  37. International Conference on Theory and Applications of Satisfiability Testing, http://www.satisfiability.org/

  38. Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43, 425–440 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  39. Patrascu, M., Williams, R.: On the possibility of faster SAT algorithms. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1065–1075 (2010)

    Google Scholar 

  40. Robson, J.M.: Algorithms for maximum independent sets. Journal of Algorithms 7, 425–440 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  41. Williams, R.: Finding paths of length k in O*(2k) time. Information Processing Letters 109(6), 315–318 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  42. Williams, R.: Non-uniform ACC circuit lower bounds. In: IEEE Conference on Computational Complexity, pp. 115–125. IEEE Computer Society Press (2011)

    Google Scholar 

  43. Woeginger, G.: Exact Algorithms for NP-Hard Problems: A Survey. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization (Edmonds Festschrift). LNCS, vol. 2570, pp. 185–207. Springer, Heidelberg (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Texas A&M University, College Station, TX, 77843, USA

    Jianer Chen

  2. School of Computing, DePaul University, 243 S. Wabash Avenue, Chicago, IL, 60604-2301, USA

    Iyad A. Kanj

Authors
  1. Jianer Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Iyad A. Kanj
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands

    Hans L. Bodlaender

  2. School of Mathematics, Statistics and Operations Research, Victoria University, P.O. Box 600, Wellington, New Zealand

    Rod Downey

  3. Institute of Informatics, University of Bergen, Postboks 7800, 5020, Bergen, Norway

    Fedor V. Fomin

  4. Computer and Automation Research Institute, Hungarian Academy of Sciences (MTA SZTAKI), Pf. 63, 1518, Budapest, Hungary

    Dániel Marx

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Chen, J., Kanj, I.A. (2012). Parameterized Complexity and Subexponential-Time Computability. In: Bodlaender, H.L., Downey, R., Fomin, F.V., Marx, D. (eds) The Multivariate Algorithmic Revolution and Beyond. Lecture Notes in Computer Science, vol 7370. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30891-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30891-8_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30890-1

  • Online ISBN: 978-3-642-30891-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation