Recomienda este artículo a tus amigos:
Computational Complexity of Counting and Sampling - Discrete Mathematics and Its Applications Miklos, Istvan (Renyi Institute, Budapest, Hungary) 1.º edición
Precio
Mex$ 2.452
sin IVA
Pedido desde almacén remoto
Entrega prevista 24 de jul. - 11 de ago.
Recibe notificaciones sobre nuevos lanzamientos de Miklos, Istvan (Renyi Institute, Budapest, Hungary)
Nuestros clientes opinan:
Añadir a tu lista de deseos de iMusic
También disponible como:
Computational Complexity of Counting and Sampling - Discrete Mathematics and Its Applications
Miklos, Istvan (Renyi Institute, Budapest, Hungary)
The purpose of the book is to give a comprehensive and detailed introduction to the computationalcomplexity of counting and sampling. The book consists of three main topics: I. Counting problems that are solvable in polynomial running time, II. Approximation algorithms for counting and sampling, III. Holographic algorithms.
378 pages, 3 Tables, black and white; 34 Illustrations, black and white
| Medios de comunicación | Libros Paperback Book (Libro con tapa blanda y lomo encolado) |
| Publicado | 20 de febrero de 2019 |
| ISBN13 | 9781138035577 |
| Editores | Taylor & Francis Ltd |
| Páginas | 408 |
| Dimensiones | 233 × 158 × 23 mm · 600 g |
| Lengua | Inglés |
