Pastāsti draugiem par šo preci:
Computational Complexity of Counting and Sampling - Discrete Mathematics and Its Applications Miklos, Istvan (Renyi Institute, Budapest, Hungary) 1. izdevums
Cena
€ 145,99
Pasūtīts no attālās noliktavas
Paredzamā piegāde . gada 3. - 17. nov.
Ziemassvētku dāvanas var atgriezt līdz 31. janvārim
Saņemiet paziņojumus par jauniem Miklos, Istvan (Renyi Institute, Budapest, Hungary) izdevumiem
Mūsu klienti saka:
Pievienot savam iMusic vēlmju sarakstam
Pieejams arī kā:
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
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2019. gada 20. februāris |
| ISBN13 | 9781138035577 |
| Izdevēji | Taylor & Francis Ltd |
| Lapas | 408 |
| Izmēri | 233 × 158 × 23 mm · 600 g |
| Valoda | Angļu |
