Few technical terms have gained such rapid notoriety as the appela-
tion HNP-complete." In the short time since its introduction in the early
1970's, this term has come to symbolize the abyss of inherent intractability
that algorithm designers increasingly face as they seek to solve larger and
more complex problems. A wide variety of commonly encountered prob-
lems from mathematics, computer science, and operations research are now
known to be NP-complete, and the collection of such problems continues to
grow almost daily. Indeed, the NP-complete problems are now so pervasive
that it is important for anyone concerned with the computational aspects of
these fields to be familiar with the meaning and implications of this concept.
2022-11-11 12:22:23
13.04MB
1
《算法概论》源自加州大学伯克利分校和加州大学圣迭戈分校本科生的算法课讲义。在表达每一种技术时，强调每个算法背后的简洁数学思想，分析其时间和空间效率，运用与其他技术类比的方法来说明特征，并提供了大量实例。主要特点：●生动的写作风格：作者贯穿一条主线，以讲故事的形式将概念娓娓道来，非常易于理解和消化。●优美地兼顾语言的生动和严谨性：《算法概论》中看不到很多数学公式，取而代之的是精确的文字叙述。●穿插注解框：内容包括人文历史背景、对复杂概念的进一步阐述、算法的扩展与重要应用等。
2022-11-06 06:20:02
42.12MB
1