Skip to main content

Smoothed Complexity Theory

  • Conference paper

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

Abstract

Smoothed analysis is a new way of analyzing algorithms introduced by Spielman and Teng (J. ACM, 2004). Classical methods like worst-case or average-case analysis have accompanying complexity classes, like P and AvgP, respectively. While worst-case or average-case analysis give us a means to talk about the running time of a particular algorithm, complexity classes allows us to talk about the inherent difficulty of problems.

Smoothed analysis is a hybrid of worst-case and average-case analysis and compensates some of their drawbacks. Despite its success for the analysis of single algorithms and problems, there is no embedding of smoothed analysis into computational complexity theory, which is necessary to classify problems according to their intrinsic difficulty.

We propose a framework for smoothed complexity theory, define the relevant classes, and prove some first results.

Keywords

  • Compression Function
  • Heuristic Scheme
  • Perturbation Model
  • Disjoint Support
  • Computational Complexity Theory

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Supported by DFG research grant BL 511/7-1. A full version of this paper is available at http://arxiv.org/abs/1202.1936

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   89.00
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   119.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arthur, D., Manthey, B., Röglin, H.: Smoothed analysis of the k-means method. J. ACM 58(5) (2011)

    Google Scholar 

  2. Beier, R., Vöcking, B.: Random knapsack in expected polynomial time. J. Comput. System Sci. 69(3), 306–329 (2004)

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. Beier, R., Vöcking, B.: Typical properties of winners and losers in discrete optimization. SIAM J. Comput. 35(4), 855–881 (2006)

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Ben-David, S., Chor, B., Goldreich, O., Luby, M.: On the theory of average case complexity. J. Comput. System Sci. 44(2), 193–219 (1992)

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Bläser, M., Manthey, B., Rao, B.V.R.: Smoothed analysis of partitioning algorithms for Euclidean functionals. Algorithmica (to appear)

    Google Scholar 

  6. Blum, A.L., Spencer, J.: Coloring random and semi-random k-colorable graphs. J. Algorithms 19(2), 204–234 (1995)

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Bogdanov, A., Trevisan, L.: Average-case complexity. Foundations and Trends in Theoret. Comput. Sci. 2(1), 1–106 (2006)

    CrossRef  MathSciNet  Google Scholar 

  8. Bohman, T., Frieze, A.M., Krivelevich, M., Martin, R.: Adding random edges to dense graphs. Random Struct. Algorithms 24(2), 105–117 (2004)

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. Coja-Oghlan, A.: Colouring semirandom graphs. Combin. Probab. Comput. 16(4), 515–552 (2007)

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Coja-Oghlan, A.: Solving NP-hard semirandom graph problems in polynomial expected time. J. Algorithms 62(1), 19–46 (2007)

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. Coja-Oghlan, A., Feige, U., Frieze, A.M., Krivelevich, M., Vilenchik, D.: On smoothed k-CNF formulas and the Walksat algorithm. In: Proc. 20th Ann. Symp. on Discrete Algorithms (SODA), pp. 451–460. SIAM (2009)

    Google Scholar 

  12. Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C., Sohler, C., Tantau, T.: Smoothed analysis of left-to-right maxima with applications. ACM Trans. Algorithms 8(3), article 30

    Google Scholar 

  13. Englert, M., Röglin, H., Vöcking, B.: Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP. In: Proc. 18th Ann. Symp. on Discrete Algorithms (SODA), pp. 1295–1304. SIAM (2007)

    Google Scholar 

  14. Feige, U.: Refuting smoothed 3CNF formulas. In: Proc. 48th Ann. Symp. on Foundations of Computer Science (FOCS), pp. 407–417. IEEE (2007)

    Google Scholar 

  15. Feige, U., Kilian, J.: Heuristics for semirandom graph problems. J. Comput. System Sci. 63(4), 639–671 (2001)

    CrossRef  MathSciNet  MATH  Google Scholar 

  16. Fouz, M., Kufleitner, M., Manthey, B., Zeini Jahromi, N.: On smoothed analysis of quicksort and Hoare’s find. Algorithmica 62(3-4), 879–905 (2012)

    CrossRef  MathSciNet  MATH  Google Scholar 

  17. Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Company (1979)

    Google Scholar 

  18. Gurevich, Y.: Average case completeness. J. Comput. System Sci. 42(3), 346–398 (1991)

    CrossRef  MathSciNet  MATH  Google Scholar 

  19. Krivelevich, M., Sudakov, B., Tetali, P.: On smoothed analysis in dense graphs and formulas. Random Struct. Algorithms 29(2), 180–193 (2006)

    CrossRef  MathSciNet  MATH  Google Scholar 

  20. Levin, L.A.: Average case complete problems. SIAM J. Comput. 15(1), 285–286 (1986)

    CrossRef  MathSciNet  MATH  Google Scholar 

  21. Li, M., Vitányi, P.M.B.: Average case complexity under the universal distribution equals worst-case complexity. Inform. Process. Lett. 42(3), 145–149 (1992)

    CrossRef  MathSciNet  MATH  Google Scholar 

  22. Manthey, B., Röglin, H.: Smoothed analysis: Analysis of algorithms beyond worst case. it – Information Technology 53(6) (2011)

    Google Scholar 

  23. Moitra, A., O’Donnell, R.: Pareto optimal solutions for smoothed analysts. In: Proc. 43rd Ann. Symp. on Theory of Computing (STOC), pp. 225–234. ACM (2011)

    Google Scholar 

  24. Röglin, H., Teng, S.-H.: Smoothed analysis of multiobjective optimization. In: Proc. 50th Ann. Symp. on Foundations of Computer Science (FOCS), pp. 681–690. IEEE (2009)

    Google Scholar 

  25. Röglin, H., Vöcking, B.: Smoothed analysis of integer programming. Math. Prog. 110(1), 21–56 (2007)

    CrossRef  MATH  Google Scholar 

  26. Spielman, D.A., Teng, S.-H.: Smoothed analysis of termination of linear programming algorithms. Math. Prog. 97(1-2), 375–404 (2003)

    MathSciNet  MATH  Google Scholar 

  27. Spielman, D.A., Teng, S.-H.: Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. J. ACM 51(3), 385–463 (2004)

    CrossRef  MathSciNet  MATH  Google Scholar 

  28. Spielman, D.A., Teng, S.-H.: Smoothed analysis: An attempt to explain the behavior of algorithms in practice. Commun. ACM 52(10), 76–84 (2009)

    CrossRef  Google Scholar 

  29. Vershynin, R.: Beyond Hirsch conjecture: Walks on random polytopes and smoothed complexity of the simplex method. SIAM J. Comput. 39(2), 646–678 (2009)

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bläser, M., Manthey, B. (2012). Smoothed Complexity Theory. In: Rovan, B., Sassone, V., Widmayer, P. (eds) Mathematical Foundations of Computer Science 2012. MFCS 2012. Lecture Notes in Computer Science, vol 7464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32589-2_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32589-2_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32588-5

  • Online ISBN: 978-3-642-32589-2

  • eBook Packages: Computer ScienceComputer Science (R0)