國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Computational complexity :a conceptu...

Goldreich, Oded.

Computational complexity :a conceptual perspective /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Computational complexity :Oded Goldreich.
其他題名:	a conceptual perspective /
作者:	Goldreich, Oded.
出版者:	Cambridge ;Cambridge University Press,2008.
面頁冊數:	xxiv, 606 p. :ill. ;27 cm.
標題:	Turing machines
ISBN:	9780521884730

Computational complexity :a conceptual perspective /
Goldreich, Oded.

Computational complexity :a conceptual perspective /Oded Goldreich. - Cambridge ;Cambridge University Press,2008. - xxiv, 606 p. :ill. ;27 cm.

Includes bibliographical references (p. 589-599) and index

Introduction and preliminaries -- P, NP and NP-completeness -- Variations on P and NP -- More resources, more power -- Space complexity -- Randomness and counting -- The bright side of hardness -- Pseudorandom generators -- Probabilistic proof systems -- Relaxing the requirements -- Appendix A: Glossary of complexity classes-- Appendix B: On the quest for lower bounds -- Appendix C: On the foundations of modern cryptography -- Appendix D:Probabilistic preliminaries and advanced topics in randomization -- Appendix E: Explicit constructions -- Appendix F: Some omitted proofs -- Appendix G: Some computational problems

ISBN: 9780521884730

LCCN: 2008006750

Nat. Bib. No.: GBA859156bnb Subjects--Topical Terms:

310021
Turing machines

LC Class. No.: QA267.7 / .G65 2008

Dewey Class. No.: 511.3/52

Computational complexity :a conceptual perspective /
LDR:01352nam 2200229 450 001 199669
003 OCoLC
005 20081211112614.0
008 090528s2008 enka b 001 0 eng
010 $a 2008006750
015 $2 bnb $a GBA859156
019 $a 181141260
020 $a 9780521884730
020 $a 052188473X : $c NT$2120
035 $a 00367248
040 $a DLC $c DLC $d BAKER $d BTCTA $d BWK $d BWX $d C#P $d GZT $d IXA $d OUP $d UKM $d YDXCP
050 0 0 $a QA267.7 $b .G65 2008
082 0 0 $2 22 $a 511.3/52
100 $a Goldreich, Oded. $3 279127
245 1 0 $a Computational complexity : $b a conceptual perspective / $c Oded Goldreich.
260 $a Cambridge ; $a New York : $c 2008. $b Cambridge University Press,
300 $a xxiv, 606 p. : $b ill. ; $c 27 cm.
504 $a Includes bibliographical references (p. 589-599) and index
505 0 $a Introduction and preliminaries -- P, NP and NP-completeness -- Variations on P and NP -- More resources, more power -- Space complexity -- Randomness and counting -- The bright side of hardness -- Pseudorandom generators -- Probabilistic proof systems -- Relaxing the requirements -- Appendix A: Glossary of complexity classes-- Appendix B: On the quest for lower bounds -- Appendix C: On the foundations of modern cryptography -- Appendix D:Probabilistic preliminaries and advanced topics in randomization -- Appendix E: Explicit constructions -- Appendix F: Some omitted proofs -- Appendix G: Some computational problems
650 $a Turing machines $3 310021
650 $a Computational complexity $3 310020