|
|
|
|
| LEADER |
01015nam a2200229 a 4500 |
| 001 |
517447 |
| 005 |
20171111225943.0 |
| 008 |
120523s2000 nyua b 101 0 eng |
| 020 |
|
|
|a 1581131844 (pbk.)
|
| 040 |
|
|
|a GrThPMO
|
| 050 |
|
|
|a QA267
|b .A27 2000
|
| 082 |
|
|
|2 19
|a 511
|
| 111 |
2 |
|
|a ACM Symposium on Theory of Computing
|c Portland, Oregon)
|d 2000 :
|
| 245 |
1 |
|
|a Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing :
|b Portland, Oregon, May 21-23, 2000 /
|c Sponsored by the ACM Special Interest Group for Algorithms and Computation Theory.
|
| 246 |
1 |
|
|a ACM Symposium on Theory of Computing
|
| 260 |
1 |
|
|a Theory of Computing
|b ACM Press,
|c c2000
|a New York, NY :
|
| 300 |
1 |
|
|a ix, 756 p. :
|b ill. ;
|c 28 cm.
|
| 504 |
1 |
|
|a Includes bibliographical references and index.
|
| 650 |
1 |
|
|a Computational complexity
|
| 650 |
1 |
|
|a Computable functions
|
| 710 |
2 |
|
|a ACM Special Interest Group for Algorithms and Computation Theory
|
| 952 |
|
|
|a GrThPMO
|b 59aff48d6c5ad17d7e5a4246
|c 952a
|d 9528
|e QA267.A27 2000
|t 7
|x m
|z Books
|
