Computational Complexity of Counting and Sampling (ePub)
(Sprache: Englisch)
The purpose of the book is to give a comprehensive and detailed introduction to the computational
complexity of counting and sampling. The book consists of three main topics: I. Counting problems that are solvable in polynomial running time, II....
complexity of counting and sampling. The book consists of three main topics: I. Counting problems that are solvable in polynomial running time, II....
sofort als Download lieferbar
eBook (ePub)
Fr. 142.90
inkl. MwSt.
- Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „Computational Complexity of Counting and Sampling (ePub)“
The purpose of the book is to give a comprehensive and detailed introduction to the computational
complexity 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.
Autoren-Porträt von Istvan Miklos
István Miklós is a Hungarian mathematician and bioinformatician at the Rényi Institute in Budapest. He holds a Ph.D. from Eotvos University in Budapest. His research interests lie in theoretical and applied computer science and combinatorics, particularly in the study of Markov chain, Monte Carlo methods and in sampling and counting combinatorial objects appearing in applied mathematics. He has more than 50 peer-reviewed scientific papers.
Bibliographische Angaben
- Autor: Istvan Miklos
- 2019, 1. Auflage, 408 Seiten, Englisch
- Verlag: Taylor & Francis
- ISBN-10: 1351971603
- ISBN-13: 9781351971607
- Erscheinungsdatum: 21.02.2019
Abhängig von Bildschirmgrösse und eingestellter Schriftgrösse kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: ePub
- Grösse: 23 MB
- Mit Kopierschutz
- Vorlesefunktion
Sprache:
Englisch
Kopierschutz
Dieses eBook können Sie uneingeschränkt auf allen Geräten der tolino Familie lesen. Zum Lesen auf sonstigen eReadern und am PC benötigen Sie eine Adobe ID.
Kommentar zu "Computational Complexity of Counting and Sampling"
0 Gebrauchte Artikel zu „Computational Complexity of Counting and Sampling“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Computational Complexity of Counting and Sampling".
Kommentar verfassen