國立虎尾科技大學 |

登入

回首頁 到查詢結果 [ subject:"Computational Complexity." ]

The nature of computation /

Moore, Cristopher.

The nature of computation /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	The nature of computation // Cristopher Moore, Stephan Mertens.
其他題名:	Computation
作者:	Moore, Cristopher.
其他作者:	Mertens, Stephan.
出版者:	Oxford [England] ;Oxford University Press, : 2011.,
面頁冊數:	xvii, 985 p. :ill. ; : 26 cm.;
標題:	Computational complexity. -
ISBN:	9780199233212 (cloth) :

The nature of computation /
Moore, Cristopher.

The nature of computation /ComputationCristopher Moore, Stephan Mertens. - first ed. - Oxford [England] ;Oxford University Press,2011. - xvii, 985 p. :ill. ;26 cm.

Includes bibliographical references (p. 945-973) and index.

Prologue -- The basics -- Insights and algorithms -- Needles in a haystack : the class NP -- Who is the hardest one of all? : NP-completeness -- The deep question : P vs. NP -- The grand unified theory of computation -- Memory, paths, and games -- Optimization and approximation -- Randomized algorithms -- Interaction and pseudorandomness -- Random walks and rapid mixing -- Counting, sampling, and statistical physics -- When formulas freeze : phase transitions in computation -- Quantum computation -- Mathematical tools.

ISBN: 9780199233212 (cloth) :NT2617

LCCN: 2011288098

Nat. Bib. No.: GBA8A4966bnbSubjects--Topical Terms:

527777
Computational complexity.

LC Class. No.: QA267.7 / .M66 2011

Dewey Class. No.: 511.3/52

The nature of computation /
LDR:01358cam a2200265 a 4500 001 707643
005 20120720180021.0
008 120807s2011 enka b 001 0 eng c
010 $a 2011288098
015 $a GBA8A4966 $2 bnb
020 $a 9780199233212 (cloth) : $c NT2617
020 $a 0199233217 (cloth)
035 $a (OCoLC)ocn180753706
035 $a 2011288098
040 $a UKM $c UKM $d BTCTA $d BAKER $d YDXCP $d CGU $d IQU $d ERL $d CDX $d NMH $d BWX $d UAB $d DLC
041 0 # $a eng
042 $a pcc
050 0 0 $a QA267.7 $b .M66 2011
082 0 0 $a 511.3/52 $2 23
100 1 $a Moore, Cristopher. $3 833020
245 1 4 $a The nature of computation / $c Cristopher Moore, Stephan Mertens.
246 3 0 $a Computation
250 $a first ed.
260 # $a Oxford [England] ; $a New York : $c 2011. $b Oxford University Press,
300 $a xvii, 985 p. : $b ill. ; $c 26 cm.
504 $a Includes bibliographical references (p. 945-973) and index.
505 0 # $a Prologue -- The basics -- Insights and algorithms -- Needles in a haystack : the class NP -- Who is the hardest one of all? : NP-completeness -- The deep question : P vs. NP -- The grand unified theory of computation -- Memory, paths, and games -- Optimization and approximation -- Randomized algorithms -- Interaction and pseudorandomness -- Random walks and rapid mixing -- Counting, sampling, and statistical physics -- When formulas freeze : phase transitions in computation -- Quantum computation -- Mathematical tools.
650 # 0 $a Computational complexity. $3 527777
700 1 # $a Mertens, Stephan. $3 833021