The complexity theory companion / by Lane A. Hemaspaandra, Mitsunori Ogihara.
Tipo de material:
TextoSeries Texts in theoretical computer scienceDetalles de publicación: Berlin : Springer, 2011. Descripción: 1 v. : ill. ; 24 cmISBN: 9783642086847 (pbk.); 3642086845 (pbk.)Tema(s): Computational complexity | Complejidad computacionalClasificación CDD: 511.352 Resumen: Here is an accessible, algorithmically oriented guide to some of the most interesting techniques of complexity theory. The book shows that simple algorithms are at the heart of complexity theory. The book is organized by technique rather than by topic. Each chapter focuses on one technique: what it is, and what results and applications it yields
| Tipo de ítem | Biblioteca de origen | Signatura | URL | Estado | Fecha de vencimiento | Código de barras | Reserva de ítems | Bibliografía recomendada |
|---|---|---|---|---|---|---|---|---|
| Manuales | 03. BIBLIOTECA INGENIERÍA PUERTO REAL | 510.6/HEM/com (Navegar estantería(Abre debajo)) | Texto completo | Disponible Ubicación en estantería | Bibliomaps® | 3744059151 |
COMPLEJIDAD COMPUTACIONAL GRADO EN INGENIERÍA INFORMÁTICA Asignatura actualizada 2023-2024 |
Total de reservas: 0
Originally published: 2002.
Here is an accessible, algorithmically oriented guide to some of the most interesting techniques of complexity theory. The book shows that simple algorithms are at the heart of complexity theory. The book is organized by technique rather than by topic. Each chapter focuses on one technique: what it is, and what results and applications it yields
No hay comentarios en este titulo.