|
|
|
|
| LEADER |
01091nam a2200205 a 4500 |
| 001 |
497138 |
| 005 |
20171111225924.0 |
| 008 |
970610s1994 nyua b 001 0 eng |
| 020 |
|
|
|a 0139153802
|
| 050 |
|
|
|a QA267.7
|b .B68 1994
|
| 082 |
|
|
|2 20
|a 511.3
|
| 100 |
1 |
|
|a Bovet, D.
|q (Daniele)
|
| 245 |
1 |
|
|a Introduction to the theory of complexity /
|c Daniel Pierre Bovet andPierluigi Crescenzi.
|
| 260 |
1 |
|
|a Hemel Hempstead, Hertfordshire :
|b Prentice Hall,
|c 1993.
|
| 300 |
1 |
|
|a xi, 282 p. :
|b ill. ;
|c 25 cm.
|
| 504 |
1 |
|
|a Includes bibliographical references (p. 265-277) and index.
|
| 505 |
1 |
|
|a 1. Mathematical preliminaries -- 2. Elements of computability theory --3. Complexity classes -- 4. The class P -- 5. The class NP -- 6. Thecomplexity of optimization problems -- 7. Beyond NP -- 8.Space-complexity classes -- 9. Probabilistic algorithms and complexityclasses -- 10. Interactive proof systems -- 11. Models of parallelcomputers -- 12. Parallel algorithms.
|
| 650 |
1 |
|
|a Computational complexity
|
| 700 |
1 |
|
|a Crescenzi, Pierluigi
|
| 952 |
|
|
|a GrThPMO
|b 59afe0d16c5ad17d7e59ef05
|c 952a
|d 9528
|e -
|t 1
|x m
|z Books
|
