385
个编辑
更改
跳到导航
跳到搜索
第270行：
第270行： − + − + − − − | last1=Arora | first1=Sanjeev | authorlink1=Sanjeev Arora − − 1 = Arora | first1 = Sanjeev | authorlink1 = Sanjeev Arora − − | last2=Barak | first2=Boaz − − − 2 = Barak | first2 = Boaz − − | title=Computational Complexity: A Modern Approach − − − | title = 计算复杂性: 一种现代方法 − − | url = http://www.cs.princeton.edu/theory/complexity/ − − − Http://www.cs.princeton.edu/theory/complexity/ − − − | publisher=Cambridge − − | publisher = Cambridge − − | year=2009 − − − 2009年 − − − | isbn=978-0-521-42426-4 − − | isbn = 978-0-521-42426-4 − − | zbl=1193.68112 − − − 1193.68112 − − }} − − }} − − − − − | last=Du − − | last = Du − − | first=Ding-Zhu − − − | 第一 = 鼎柱 − − − | author2=Ko, Ker-I − − | author2 = Ko，Ker-I − − | title=Theory of Computational Complexity − − − 计算复杂性理论 − − − | publisher=John Wiley & Sons − − 2012年3月24日 | publisher = 约翰威立 − − | year=2000 − − − 2000年 − − | isbn=978-0-471-34506-0 − − − | isbn = 978-0-471-34506-0 − − }} − − − }} − − − − | last=Goldreich − − − | last = Goldreich − − | first=Oded − − + − 第一个 = Oded − − − − | authorlink=Oded Goldreich − − | authorlink = Oded Goldreich − − | url = http://www.wisdom.weizmann.ac.il/~oded/cc-book.html − − − Http://www.wisdom.weizmann.ac.il/~oded/cc-book.html − − − | title = Computational Complexity: A Conceptual Perspective − − | title = 计算复杂性: 一个概念性的视角 − − | publisher = Cambridge University Press − − − 剑桥大学出版社 − − − | year = 2008 − − 2008年 − − }} − − − }} − − − | editor1-last=van Leeuwen − − | editor1-last=van Leeuwen − − − − | editor1-first=Jan − − 1-first = Jan − − | editor1-link = Jan van Leeuwen − − − | editor1-link = Jan van Leeuwen − − | title=Handbook of theoretical computer science (vol. A): algorithms and complexity − − − | title = 理论计算机科学手册。A)算法和复杂性 − − − | publisher=MIT Press − − | publisher = MIT Press − − | isbn=978-0-444-88071-0 − − − | isbn = 978-0-444-88071-0 − − − | year=1990 − − 1990年 − − }} − − − }} − − − | last = Papadimitriou − − − | last = Papadimitriou − − + − − − 第一季，克里斯托 − − | authorlink = Christos Papadimitriou − − | authorlink = Christos Papadimitriou − − 作者/链接 = 赫里斯托斯·帕帕季米特里乌 − − − | title = Computational Complexity − − | title = 计算复杂性 − − | edition = 1st − − − 1st − − | year = 1994 − − − 1994年 − − | publisher = Addison Wesley − − − 艾迪生 · 韦斯利 − − − | isbn = 0-201-53082-1 − − | isbn = 0-201-53082-1 − − }} − − }} − − − − |last=Sipser − − − 最后 = Sipser − − |first=Michael − − + − 迈克尔 − − − − |authorlink=Michael Sipser − − | authorlink = Michael Sipser − − − |title=Introduction to the Theory of Computation − − | title = 美国计算理论学会简介 − − |edition=2nd − − − 2nd − − − |year=2006 − − 2006年 − − − |publisher=Thomson Course Technology − − | publisher = Thomson Course Technology − − |location=USA − − − | location = USA − − − |isbn=0-534-95097-3 − − | isbn = 0-534-95097-3 − − }}+ − + − }}+ 第609行：
第347行： − 类别: 计算复杂性理论+ − − [[Category:Computational resources]] − − Category:Computational resources − − 类别: 计算资源 − − 第624行：
第354行： −
→References
==References==
==References==
==References==
*{{Citation
*{{Citation
| last1=Arora | first1=Sanjeev | author-link1=Sanjeev Arora
| last1=Arora | first1=Sanjeev | authorlink1=Sanjeev Arora
| last2=Barak | first2=Boaz
| last2=Barak | first2=Boaz
| title=Computational Complexity: A Modern Approach
| title=Computational Complexity: A Modern Approach
| url = http://www.cs.princeton.edu/theory/complexity/
| url = http://www.cs.princeton.edu/theory/complexity/
| publisher=[[Cambridge University Press|Cambridge]]
| publisher=[[Cambridge University Press|Cambridge]]
| year=2009
| year=2009
| isbn=978-0-521-42426-4
| isbn=978-0-521-42426-4
| zbl=1193.68112
| zbl=1193.68112
}}
}}
* {{citation
* {{citation
| last=Du
| last=Du
| first=Ding-Zhu
| first=Ding-Zhu
| author2=Ko, Ker-I
| author2=Ko, Ker-I
| title=Theory of Computational Complexity
| title=Theory of Computational Complexity
| publisher=[[John Wiley & Sons]]
| publisher=[[John Wiley & Sons]]
| year=2000
| year=2000
| isbn=978-0-471-34506-0
| isbn=978-0-471-34506-0
}}
}}
* {{Garey-Johnson}}
* {{Garey-Johnson}}
* {{Citation
* {{Citation
| last=Goldreich
| last=Goldreich
| first=Oded
| first=Oded
| author-link=Oded Goldreich
| authorlink=Oded Goldreich
| url = http://www.wisdom.weizmann.ac.il/~oded/cc-book.html
| url = http://www.wisdom.weizmann.ac.il/~oded/cc-book.html
| title = Computational Complexity: A Conceptual Perspective
| title = Computational Complexity: A Conceptual Perspective
| publisher = Cambridge University Press
| publisher = Cambridge University Press
| year = 2008
| year = 2008
}}
}}
* {{Citation
* {{Citation
| editor1-last=van Leeuwen
| editor1-last=van Leeuwen
| editor1-first=Jan
| editor1-first=Jan
| editor1-link = Jan van Leeuwen
| editor1-link = Jan van Leeuwen
| title=Handbook of theoretical computer science (vol. A): algorithms and complexity
| title=Handbook of theoretical computer science (vol. A): algorithms and complexity
| publisher=[[MIT Press]]
| publisher=[[MIT Press]]
| isbn=978-0-444-88071-0
| isbn=978-0-444-88071-0
| year=1990
| year=1990
}}
}}
* {{citation
* {{citation
| last = Papadimitriou
| last = Papadimitriou
| first = Christos
| first = Christos
| author-link = Christos Papadimitriou
| first = Christos
| title = Computational Complexity
| title = Computational Complexity
| edition = 1st
| edition = 1st
| year = 1994
| year = 1994
| publisher = Addison Wesley
| publisher = Addison Wesley
| isbn = 0-201-53082-1
| isbn = 0-201-53082-1
}}
}}
* {{Citation
* {{Citation
|last=Sipser
|last=Sipser
|first=Michael
|first=Michael
|author-link=Michael Sipser
|authorlink=Michael Sipser
|title=[[Introduction to the Theory of Computation]]
|title=[[Introduction to the Theory of Computation]]
|edition=2nd
|edition=2nd
|year=2006
|year=2006
|publisher=[[Thomson Learning|Thomson Course Technology]]
|publisher=[[Thomson Learning|Thomson Course Technology]]
|location=USA
|location=USA
|isbn=0-534-95097-3
|isbn=0-534-95097-3
}}
}}
[[Category:Analysis of algorithms]]
[[Category:Computational complexity theory]]
[[Category:Computational resources]]
Category:Computational complexity theory
Category:Computational complexity theory
== 编者推荐 ==
== 编者推荐 ==
====[https://swarma.org/?p=10487 找到你混乱生活中的秩序——Kolmogorov复杂度]====
====[https://swarma.org/?p=10487 找到你混乱生活中的秩序——Kolmogorov复杂度]====
如何判断一段话信息量是大是小？在香农那里，可以用“克服了多少不确定性”来描述。而在柯尔莫哥洛夫那里，要看“用多长的代码能生成这句话”。
如何判断一段话信息量是大是小？在香农那里，可以用“克服了多少不确定性”来描述。而在柯尔莫哥洛夫那里，要看“用多长的代码能生成这句话”。