|
|
|
|
| LEADER |
01761cam a2200313 a 4500 |
| 005 |
20130713153822.0 |
| 008 |
111020s2011 enka b 001 0 eng c |
| 010 |
|
|
|a 2011288098
|
| 015 |
|
|
|a GBA8A4966
|2 bnb
|
| 016 |
7 |
|
|a 014707632
|2 Uk
|
| 020 |
|
|
|a 9780199233212 (acidfree paper)
|
| 020 |
|
|
|a 0199233217 (acidfree paper)
|
| 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 HR-ZaFER
|b hrv
|e ppiak
|
| 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.
|
| 245 |
1 |
4 |
|a The nature of computation /
|c Cristopher Moore, Stephan Mertens.
|
| 246 |
3 |
0 |
|a Computation
|
| 260 |
|
|
|a Oxford [England] ;
|a New York :
|b Oxford University Press,
|c 2011.
|
| 300 |
|
|
|a xvii, 985 str. :
|b ilustr. ;
|c 24 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.
|
| 700 |
1 |
|
|a Mertens, Stephan.
|
| 906 |
|
|
|a 7
|b cbc
|c pccadap
|d 2
|e ncip
|f 20
|g y-gencatlg
|
| 942 |
|
|
|2 udc
|c K
|
| 955 |
|
|
|a xh06 2011-10-20 to STM
|a xh00 2011-10-21 to USPL/STM
|a xh00 2011-10-31 to USPL/STM
|a rf18 2011-11-17 additional copy received
|b xh14 2011-12-22 z-processor
|i xh58 2012-01-13 ; to Dewey 2012-01-13
|
| 999 |
|
|
|c 41133
|d 41133
|
