arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.13241cs.DSstat.ML
收藏

超越算法的最坏情况分析(导论)

Beyond the Worst-Case Analysis of Algorithms (Introduction)

Tim Roughgarden

摘要:

算法的数学分析的主要目标之一是提供关于哪种算法是解决给定计算问题的“最佳”算法的指导。最坏情况分析通过算法在给定大小的任何输入上的最差性能来总结算法的性能概况,隐含地提倡具有最佳可能的最坏情况性能的算法。强的最坏情况保证是算法设计的圣杯,它提供了一个与应用无关的算法鲁棒良好性能的证明。然而,对于许多基本问题和业绩衡量标准,这种保证是不可能的,需要一种更细致入微的分析方法。本章将介绍最坏情况分析的几种替代方法,本书后面将详细讨论这些方法。

英文摘要:

One of the primary goals of the mathematical analysis of algorithms is to provide guidance about which algorithm is the "best" for solving a given computational problem. Worst-case analysis summarizes the performance profile of an algorithm by its worst performance on any input of a given size, implicitly advocating for the algorithm with the best-possible worst-case performance. Strong worst-case guarantees are the holy grail of algorithm design, providing an application-agnostic certification of an algorithm's robustly good performance. However, for many fundamental problems and performance measures, such guarantees are impossible and a more nuanced analysis approach is called for. This chapter surveys several alternatives to worst-case analysis that are discussed in detail later in the book.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑