Cargando…
Theories of computational complexity /
This volume presents four machine-independent theories of computational complexity, which have been chosen for their intrinsic importance and practical relevance. The book includes a wealth of results - classical, recent, and others which have not been published before. In developing the mathematics...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Amsterdam ; New York : New York, N.Y., U.S.A. :
North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.,
1988.
|
| Colección: | Annals of discrete mathematics ;
35. |
| Temas: | |
| Acceso en línea: | Texto completo Texto completo Texto completo |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | SCIDIR_ocn316565370 | ||
| 003 | OCoLC | ||
| 005 | 20231117015232.0 | ||
| 006 | m o d | ||
| 007 | cr cn||||||||| | ||
| 008 | 090320s1988 ne ob 001 0 eng d | ||
| 040 | |a OPELS |b eng |e pn |c OPELS |d OPELS |d OCLCQ |d N$T |d OCLCE |d IDEBK |d E7B |d MERUC |d OCLCO |d OCLCF |d DEBBG |d YDXCP |d OCLCQ |d DEBSZ |d OCLCQ |d LEAUB |d ADU |d VLY |d LUN |d S2H |d OCLCO |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO | ||
| 019 | |a 301221023 |a 312441675 |a 571979237 |a 646775900 |a 1086440880 |a 1160078246 |a 1162279326 | ||
| 020 | |a 9780444703569 | ||
| 020 | |a 044470356X | ||
| 020 | |a 9780080867755 |q (electronic bk.) | ||
| 020 | |a 0080867758 |q (electronic bk.) | ||
| 020 | |a 1281793132 | ||
| 020 | |a 9781281793133 | ||
| 020 | |a 9786611793135 | ||
| 020 | |a 6611793135 | ||
| 035 | |a (OCoLC)316565370 |z (OCoLC)301221023 |z (OCoLC)312441675 |z (OCoLC)571979237 |z (OCoLC)646775900 |z (OCoLC)1086440880 |z (OCoLC)1160078246 |z (OCoLC)1162279326 | ||
| 042 | |a dlr | ||
| 050 | 4 | |a QA267 |b .C34 1988eb | |
| 072 | 7 | |a MAT |x 000000 |2 bisacsh | |
| 082 | 0 | 4 | |a 511 |2 22 |
| 084 | |a 31.10 |2 bcl | ||
| 084 | |a 54.10 |2 bcl | ||
| 084 | |a 54.50 |2 bcl | ||
| 100 | 1 | |a Calude, Cristian, |d 1952- | |
| 245 | 1 | 0 | |a Theories of computational complexity / |c Christian Calude. |
| 260 | |a Amsterdam ; |a New York : |b North-Holland ; |a New York, N.Y., U.S.A. : |b Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., |c 1988. | ||
| 300 | |a 1 online resource (xiii, 487 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Annals of discrete mathematics ; |v 35 | |
| 520 | |a This volume presents four machine-independent theories of computational complexity, which have been chosen for their intrinsic importance and practical relevance. The book includes a wealth of results - classical, recent, and others which have not been published before. In developing the mathematics underlying the size, dynamic and structural complexity measures, various connections with mathematical logic, constructive topology, probability and programming theories are established. The facts are presented in detail. Extensive examples are provided, to help clarify notions and constructions. The lists of exercises and problems include routine exercises, interesting results, as well as some open problems. | ||
| 504 | |a Includes bibliographical references (pages 453-468). | ||
| 500 | |a Includes indexes. | ||
| 588 | 0 | |a Print version record. | |
| 506 | |3 Use copy |f Restrictions unspecified |2 star |5 MiAaHDL | ||
| 533 | |a Electronic reproduction. |b [Place of publication not identified] : |c HathiTrust Digital Library, |d 2010. |5 MiAaHDL | ||
| 538 | |a Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. |u http://purl.oclc.org/DLF/benchrepro0212 |5 MiAaHDL | ||
| 583 | 1 | |a digitized |c 2010 |h HathiTrust Digital Library |l committed to preserve |2 pda |5 MiAaHDL | |
| 505 | 0 | |a Front Cover; Theories of Computational Complexity; Copyright Page; Contents; Preface; Introduction; Chapter 1; 1. Primitive Recursive Hierarchies; 1.1. Examples; 1.2. Ackermann-Peter's Hierarchy; 1.3. Primitive Recursive Functions; 1.4. Primitive Recursive Invariants; 1.5. Primitive Recursive Enumerations; 1.6. Sudan's Hierarchy; 1.7. Universal Sequences of Primitive Recursive Functions; 1.8. Primitive Recursive String-functions; 1.9. History; 1.10. Exercises and Problem; Chapter 2; 2. Recursive Functions; 2.1. Examples; 2.2. Arithmetization of Computation: An Example | |
| 505 | 8 | |a 2.3. Equational Characterization of Partial Recursive Functions2.4. GODEL Numberings; 2.5. Recursively Enumerable Sets; 2.6. Undecidability and Independence; 2.7. Uniformity; 2.8. Operators; 2.9. Recursive Real Numbers; 2.10. History; 2.11. Exercises and Problems; Chapter 3; 3. BLUM's Complexity Theory; 3.1. Examples; 3.2. BLUM Spaces; 3.3. Recursive Dependence of Complexity Measures; 3.4. Complexity Classes; 3.5. The Speed-up Phenomenon; 3.6. The Union Theorem; 3.7. Hard Recursive Functions; 3.8. Complexity Sequences; 3.9. A Topological Analysis; 3.10. History; 3.11. Exercises and Problems | |
| 505 | 8 | |a Chapter 44. KOLMOGOROV and MARTIN-LOF's Complexity Theory; 4.1. Examples; 4.2. KOLMOGOROV's Complexity; 4.3. MARTIN-LOF Tests; 4.4. Undecidability Theorems; 4.5. Representability Theorems; 4.6. Recursive MARTIN-LOF Tests; 4.7. Infinite Oscillations; 4.8. Probabilistic Algorithms; 4.9. History; 4.10. Exercises and Problems; Chapter 5; 5. Subrecursive Programming Hierarchies; 5.1. Examples; 5.2. The LOOP Language; 5.3. LOOP Hierarchies; 5.4. A Universal Language; 5.5. A Dynamic Characterization of LOOP Classes; 5.6. Augmented LOOP Languages; 5.7. Simple Functions; 5.8. Program Size | |
| 505 | 8 | |a 5.9. History5.10. Exercises and Problems; Bibliography; Index of notations; Subject index; Author index | |
| 546 | |a English. | ||
| 650 | 0 | |a Computational complexity. | |
| 650 | 6 | |a Complexit�e de calcul (Informatique) |0 (CaQQLa)201-0068287 | |
| 650 | 7 | |a MATHEMATICS |x General. |2 bisacsh | |
| 650 | 7 | |a Computational complexity |2 fast |0 (OCoLC)fst00871991 | |
| 650 | 1 | 7 | |a Fundamentele informatica. |2 gtt |
| 776 | 0 | 8 | |i Print version: |a Calude, Cristian, 1952- |t Theories of computational complexity. |d Amsterdam ; New York : North-Holland ; New York, N.Y., U.S.A. : Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1988 |z 044470356X |z 9780444703569 |w (DLC) 87030864 |w (OCoLC)16980515 |
| 830 | 0 | |a Annals of discrete mathematics ; |v 35. | |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/book/9780444703569 |z Texto completo |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/publication?issn=01675060&volume=35 |z Texto completo |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/bookseries/01675060/35 |z Texto completo |