An introduction to the general theory of algorithms /
Guardado en:
| Autor Principal: | |
|---|---|
| Otros Autores: | |
| Formato: | Libro |
| Idioma: | English |
| Publicado: |
New York :
North-Holland,
c1978.
|
| Series: | Theory of computation series
|
| Materias: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| LEADER | 01226cam a2200289 a 4500 | ||
|---|---|---|---|
| 001 | MAT.inmabb002727 | ||
| 008 | 770712s1978####nyu######b####001#0#eng## | ||
| 005 | 20160608171604.0 | ||
| 245 | 1 | 3 | |a An introduction to the general theory of algorithms / |c Michael Machtey, Paul Young. |
| 260 | |a New York : |b North-Holland, |c c1978. | ||
| 300 | |a vii, 264 p. ; |c 24 cm. | ||
| 490 | 0 | |a Theory of computation series | |
| 500 | |a "The computer science library." | ||
| 504 | |a Bibliografía: p. 252-254. | ||
| 505 | 8 | |a Capítulos: 1. Models of computation -- 2. Reductions, coding of RAM programs, unsolvable problems -- 3. Basic recursive function theory -- 4. Applications to mathematical logic -- 5. General computational complexity theory -- 6. Exponentially and superexponentially difficult problems -- 7. Complete problems. | |
| 510 | 4 | |a MR, |c 81k:68001 | |
| 020 | |a 044400226X | ||
| 020 | |a 0444002278 (pbk.) | ||
| 100 | 1 | |a Machtey, Michael. | |
| 700 | 1 | |a Young, Paul, |d 1936- | |
| 650 | 0 | |a Programming languages (Electronic computers) | |
| 650 | 0 | |a Computer algorithms. | |
| 650 | 0 | |a Recursive functions. | |
| 084 | |a 68W01 |2 msc2000 | ||
| 010 | |a 77022046 | ||
| 040 | |a DLC |c DLC |d DLC | ||
| 859 | |h 68 |i M151 |p A-5181 |b BIB. MATEMATICA | ||