CLRS (Introduction to Algorithms 2nd) reading notes 6 – (final for 1st round)

saintony

于 2010-07-25 22:15:00 发布

阅读量767

点赞数

分类专栏： Basics & Theories 文章标签： extension application basic

本文链接：https://blog.youkuaiyun.com/saintony/article/details/5766054

版权

Basics & Theories 专栏收录该内容

46 篇文章

订阅专栏

本文总结了CLRS第二版最后三章的学习心得：计算几何章节介绍了几何技能的应用；NP完全性章节讨论了复杂度理论的核心问题，并表达了作者对于P≠NP的看法；近似算法章节则提供了解决NP难问题的实用方法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

This note is for the last three chapters of CLRS 2nd.

Chapter 33: Computational Geometry. Some application of geometrical skills. Not too much brand new thoughts, but still beneficial and interesting.

Chapter 34: NP-Completeness. I love this topic very much but NPC is really an obscure stuff. NPC is not about reasoning and deduction and it is kind of a “philosophy” question: does it, or does it not? People haven’t found a good way to make a reasonable description for the “complexity” yet. P != NP… I guess so.

Chapter 35: Approximate Algorithms. This chapter can be treated as the extension of the NPC chapter. Though NPC blocks us, we can still find some circumvention solutions for the problems. The basic skills are almost the algorithms from the former chapters, as greedy, linear programming etc.

Well, it is the first round of this book. Basically speaking… I insist that CLRS is a maths book actually, and readers should treat it as a typical mathematical book – read the text and do the exercises..

I’ll read it again, again and again, until..