000 | 01971cam a2200349 a 4500 | ||
---|---|---|---|
999 |
_c3407 _d3407 |
||
001 | 17009850 | ||
005 | 20220812125151.0 | ||
008 | 111020s2011 enka b 001 0 eng c | ||
010 | _a 2011288098 | ||
015 |
_aGBA8A4966 _2bnb |
||
016 | 7 |
_a014707632 _2Uk |
|
020 | _a9780199233212 (acidfree paper) | ||
020 | _a0199233217 (acidfree paper) | ||
035 | _a(OCoLC)ocn180753706 | ||
040 |
_aUKM _cUKM _dBTCTA _dBAKER _dYDXCP _dCGU _dIQU _dERL _dCDX _dNMH _dBWX _dUAB _dDLC |
||
042 | _apcc | ||
050 | 0 | 0 |
_aQA267.7 _b.M66 2011 |
082 | 0 | 0 |
_a511.3/52 _223 |
100 | 1 | _aMoore, Cristopher. | |
245 | 1 | 4 |
_aThe nature of computation / _cCristopher Moore, Stephan Mertens. |
246 | 3 | 0 | _aComputation |
260 |
_aOxford [England] ; _aNew York : _bOxford University Press, _c2011. |
||
300 |
_axvii, 985 p. : _bill. ; _c24 cm. |
||
504 | _aIncludes bibliographical references (p. 945-973) and index. | ||
505 | 0 | _aPrologue -- 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 | _aComputational complexity. | |
700 | 1 | _aMertens, Stephan. | |
856 |
_uhttps://box.skoltech.ru/index.php/apps/files?dir=/e-books%20library/The%20Nature%20of%20Computation&fileid=6381898#pdfviewer _zFull-text here |
||
906 |
_a7 _bcbc _cpccadap _d2 _encip _f20 _gy-gencatlg |
||
942 |
_2lcc _cBK |