Computational Complexity of Counting and Sampling
3209 Kč
Odesíláme do 5 až 7 dní
Sleva až 70% u třetiny knih
The purpose of the book is to give a comprehensive and detailed introduction to the computational complexity of counting and sampling. The book will consist of three main topics: I. Counting problems that are solvable in polynomial running time, II. Approximation algorithms for counting and sampling, III. Holographic algorithms--
| Autor: | Miklos, Istvan (Renyi Institute, Budapest, Hungary) |
| Nakladatel: | Taylor & Francis Ltd |
| ISBN: | 9781138035577 |
| Rok vydání: | 2019 |
| Jazyk : | Angličtina |
| Vazba: | Paperback / softback |
| Počet stran: | 390 |
Mohlo by se vám také líbit..
-
Introduction to AutoCAD 2020
-
Spatio-Temporal Statistics with R
Wikle, Christopher K.; Zammit-Mangion, Andrew; Cressie, Noel
-
The Need for Roots
Simone Weil
-
The Goal
Eliyahu M. Goldratt
-
A Practical Guide to Indie Game Marke...
Dreskin, Joel (Indie Marketing Professional)
-
The Shadow of the Tsunami
Bromberg, Philip M.
-
Basic Dutch: A Grammar and Workbook
Oosterhoff, Jenneke
-
The Atlas of Migration in Europe
Migreurop; Clochard, Olivier
-
Probability and Statistics for Compu...
Michael Armstrong
-
Feminist Applied Sport Psychology
-
The Art of Game Design
Schell, Jesse
-
The Routledge Introductory Course in ...
Etzion, Giore
-
Cognitive Development and Cognitive ...
Goswami, Usha
-
Systemic Coaching
Peter Hawkins
-
Cognitive Poetics
Stockwell, Peter
-
Designing with Light
Gillette, Michael
