Abstract
Smoothed analysis is a new way of analyzing algorithms introduced by Spielman and Teng. Classical methods like worst-case or average-case analysis have accompanying complexity classes, such as P and Avg-P, respectively. Whereas worst-case or average-case analysis give us a means to talk about the running time of a particular algorithm, complexity classes allow 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 hardness results (of bounded halting and tiling) and tractability results (binary optimization problems, graph coloring, satisfiability) within this framework.
- Sanjeev Arora and Boaz Barak. 2009. Computational Complexity: A Modern Approach. Cambridge University Press, New York, NY. Google Scholar
Cross Ref
- David Arthur, Bodo Manthey, and Heiko Röglin. 2011. Smoothed analysis of the k-means method. Journal of the ACM 58, 5, Article No. 19. Google Scholar
Digital Library
- Cyril Banderier, René Beier, and Kurt Mehlhorn. 2003. Smoothed analysis of three combinatorial problems. In Mathematical Foundations of Computer Science 2003. Lecture Notes in Computer Science, Vol. 2747. Springer, 198--207.Google Scholar
- René Beier and Berthold Vöcking. 2004. Random knapsack in expected polynomial time. Journal of Computer and System Sciences 69, 3, 306--329. Google Scholar
Digital Library
- René Beier and Berthold Vöcking. 2006. Typical properties of winners and losers in discrete optimization. SIAM Journal on Computing 35, 4, 855--881. Google Scholar
Digital Library
- Shai Ben-David, Benny Chor, Oded Goldreich, and Michael Luby. 1992. On the theory of average case complexity. Journal of Computer and System Sciences 44, 2, 193--219. Google Scholar
Digital Library
- Markus Bläser, Bodo Manthey, and B. V. Raghavendra Rao. 2013. Smoothed analysis of partitioning algorithms for Euclidean functionals. Algorithmica 66, 2, 397--418.Google Scholar
Cross Ref
- Avrim L. Blum and John D. Dunagan. 2002. Smoothed analysis of the perceptron algorithm for linear programming. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’02). 905--914. Google Scholar
Digital Library
- Avrim L. Blum and Joel Spencer. 1995. Coloring random and semi-random k-colorable graphs. Journal of Algorithms 19, 2, 204--234. Google Scholar
Digital Library
- Andrej Bogdanov and Luca Trevisan. 2006. Average-case complexity. Foundations and Trends in Theoretical Computer Science 2, 1, 1--106. Google Scholar
Digital Library
- Tom Bohman, Alan M. Frieze, Michael Krivelevich, and Ryan Martin. 2004. Adding random edges to dense graphs. Random Structures and Algorithms 24, 2, 105--117. Google Scholar
Digital Library
- Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, and Heiko Röglin. 2013a. Smoothed analysis of belief propagation for minimum-cost flow and matching. Journal of Graph Algorithms and Applications 17, 6, 647--670.Google Scholar
Cross Ref
- Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey, and Heiko Röglin. 2013b. Smoothed analysis of the successive shortest path algorithm. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’13). 1180--1189. Google Scholar
Digital Library
- Tobias Brunsch and Heiko Röglin. 2015. Improved smoothed analysis of multiobjective optimization. Journal of the ACM 62, 1, 4. Google Scholar
Digital Library
- Xi Chen, Xiaotie Deng, and Shang-Hua Teng. 2009. Settling the complexity of computing two-player Nash equilibria. Journal of the ACM 56, 3, Article No. 14. Google Scholar
Digital Library
- Amin Coja-Oghlan. 2007a. Colouring semirandom graphs. Combinatorics, Probability and Computing 16, 4, 515--552. Google Scholar
Digital Library
- Amin Coja-Oghlan. 2007b. Solving NP-hard semirandom graph problems in polynomial expected time. Journal of Algorithms 62, 1, 19--46. Google Scholar
Digital Library
- Amin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, and Dan Vilenchik. 2009. On smoothed k-CNF formulas and the walksat algorithm. In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’09). 451--460. Google Scholar
Digital Library
- Valentina Damerow, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, and Till Tantau. 2012. Smoothed analysis of left-to-right maxima with applications. ACM Transactions on Algorithms 8, 3, Article No. 30. Google Scholar
Digital Library
- Matthias Englert, Heiko Röglin, and Berthold Vöcking. 2014. Worst case and probabilistic analysis of the 2-opt algorithm for the TSP. Algorithmica 68, 1, 190--264.Google Scholar
Cross Ref
- Uriel Feige. 2007. Refuting smoothed 3CNF formulas. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS’07). IEEE, Los Alamitos, CA, 407--417. Google Scholar
Digital Library
- Uriel Feige and Joe Kilian. 2001. Heuristics for semirandom graph problems. Journal of Computer and System Sciences 63, 4, 639--671. Google Scholar
Digital Library
- Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, and Nima Zeini Jahromi. 2012. On smoothed analysis of quicksort and Hoare’s find. Algorithmica 62, 3--4, 879--905. Google Scholar
Digital Library
- Michael R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, NY. Google Scholar
Digital Library
- Yuri Gurevich. 1991. Average case completeness. Journal of Computer and System Sciences 42, 3, 346--398. Google Scholar
Digital Library
- Russell Impagliazzo, Ramamohan Paturi, and Francis Zane. 2001. Which problems have strongly exponential complexity? Journal of Computer and System Sciences 63, 4, 512--530. Google Scholar
Digital Library
- Michael Krivelevich, Benny Sudakov, and Prasad Tetali. 2006. On smoothed analysis in dense graphs and formulas. Random Structures and Algorithms 29, 2, 180--193. Google Scholar
Digital Library
- Leonid A. Levin. 1986. Average case complete problems. SIAM Journal on Computing 15, 1, 285--286. Google Scholar
Digital Library
- Ming Li and Paul M. B. Vitányi. 1992. Average case complexity under the universal distribution equals worst-case complexity. Information Processing Letters 42, 3, 145--149. Google Scholar
Digital Library
- Ming Li and Paul M. B. Vitányi. 1993. An Introduction to Kolmogorov Complexity and Its Applications. Springer, New York, NY. Google Scholar
Digital Library
- Bodo Manthey and Rüdiger Reischuk. 2007. Smoothed analysis of binary search trees. Theoretical Computer Science 378, 3, 292--315. Google Scholar
Digital Library
- Bodo Manthey and Heiko Röglin. 2011. Smoothed analysis: Analysis of algorithms beyond worst case. Information Technology 53, 6, 280--286.Google Scholar
Cross Ref
- Bodo Manthey and Heiko Röglin. 2013. Worst-case and smoothed analysis of k-means clustering with Bregman divergences. Journal of Computational Geometry 4, 1, 94--132.Google Scholar
- Bodo Manthey and Rianne Veenstra. 2013. Smoothed analysis of the 2-opt heuristic for the TSP: Polynomial bounds for Gaussian noise. In Algorithms and Computation. Lecture Notes in Computer Science, Vol. 8283. Springer, 579--589.Google Scholar
- Ankur Moitra and Ryan O’Donnell. 2011. Pareto optimal solutions for smoothed analysts. In Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC’11). ACM, New York, NY, 225--234. Google Scholar
Digital Library
- Heiko Röglin and Shang-Hua Teng. 2009. Smoothed analysis of multiobjective optimization. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS’09). IEEE, Los Alamitos, CA, 681--690. Google Scholar
Digital Library
- Heiko Röglin and Berthold Vöcking. 2007. Smoothed analysis of integer programming. Mathematical Programming 110, 1, 21--56. Google Scholar
Digital Library
- Daniel A. Spielman and Shang-Hua Teng. 2003. Smoothed analysis of termination of linear programming algorithms. Mathematical Programming 97, 1--2, 375--404.Google Scholar
Cross Ref
- Daniel A. Spielman and Shang-Hua Teng. 2004. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of the ACM 51, 3, 385--463. Google Scholar
Digital Library
- Daniel A. Spielman and Shang-Hua Teng. 2009. Smoothed analysis: An attempt to explain the behavior of algorithms in practice. Communications of the ACM 52, 10, 76--84. Google Scholar
Digital Library
- Roman Vershynin. 2009. Beyond Hirsch conjecture: Walks on random polytopes and smoothed complexity of the simplex method. SIAM Journal on Computing 39, 2, 646--678. Google Scholar
Digital Library
- Jie Wang. 1997. Average-case intractable NP problems. In Advances in Languages, Algorithms, and Complexity, D.-Z. Du and K.-I. Ko (Eds.). Kluwer, Dordrecht, Netherlands, 313--378.Google Scholar
- Herbert S. Wilf. 1985. Some examples of combinatorial averaging. American Mathematical Monthly 92, 4, 250--261.Google Scholar
Cross Ref
Index Terms
Smoothed Complexity Theory
Recommendations
On the average-case complexity of MCSP and its variants
CCC '17: Proceedings of the 32nd Computational Complexity ConferenceWe prove various results on the complexity of MCSP (Minimum Circuit Size Problem) and the related MKTP (Minimum Kolmogorov Time-Bounded Complexity Problem):
• We observe that under standard cryptographic assumptions, MCSP has a pseudorandom self-...
Smoothed complexity theory
MFCS'12: Proceedings of the 37th international conference on Mathematical Foundations of Computer ScienceSmoothed 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 Avg−P, respectively. While worst-case or ...
The Program-Enumeration Bottleneck in Average-Case Complexity Theory
CCC '10: Proceedings of the 2010 IEEE 25th Annual Conference on Computational ComplexityThree fundamental results of Levin involve algorithms or reductions whose running time is exponential in the length of certain programs. We study the question of whether such dependency can be made polynomial. \begin{enumerate} \item Levin's ``optimal ...






Comments