Stability of Time-Delay Systems (Gu KeQin)

时间:2015-12-19 10:44:28
【文件属性】:

文件名称:Stability of Time-Delay Systems (Gu KeQin)

文件大小:2.13MB

文件格式:PDF

更新时间:2015-12-19 10:44:28

Stability

时滞系统稳定性必备书That every problem in NP can be polynomially reduced to an NP-hard problem suggests a proof for NP-hardness. It follows that if a problem ℘1 is NP-hard and polynomially reducible to some problem ℘2, then ℘2 must also be NP-hard. In other words, if one is to prove that ℘2 is NP- hard, one may attempt to reduce polynomially a known NP-hard problem ℘1 to ℘2. In particular, it suffices to polynomially reduce ℘1 to just one instance of ℘2, since that particular instance of ℘2 is as difficult as any instance of ℘1, and therefore in the worst case, ℘2 must be as difficult as ℘1. A vast number of NP-hard and NP-complete problems have been discovered in this manner, among them notably are such classical problems as the satisÞability problem and the traveling salesman problem. The same strategy is adopted in our proof of the NP-hardness of the stability problem


网友评论

  • 书很好,而且定理过程简洁易懂
  • 很不错的电子书。 虽然不是完整的出版版本,有部分修改。 不过内容完整,值得一看。
  • 楼主分享的这份文件为作者顾先生在书正式出版前的共享电子本,虽然文件中有少许错误,但是还是很有实用价值,十分感谢楼主