Computational Complexity of Counting and Sampling
3117 Kč
Odesíláme do 1 až 2 tý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..
-
The Art of Game Design
Schell, Jesse
-
Game Engine Architecture, Third Edition
Jason Gregory
-
Real-Time Rendering, Fourth Edition
Akenine-Möller, Tomas
-
3ds Max Modeling for Games
Andrew Gahan
-
Official (ISC)2 (R) Guide to the ISS...
-
Optimal Audio and Video Reproduction...
Verdult, Vincent
-
Game Design Workshop
Fullerton, Tracy
-
Interactive Visual Data Analysis
-
Natural Language Understanding and C...
Yokota, Masao (Fukuoka Institute of Technology, Japan)
-
AI for Games, Third Edition
Millington, Ian
-
Enterprise Security Architecture
Pinder John, Usherwood Simon
-
Gender in Music Production
-
Transition Engineering
Krumdieck, Susan (University of Canterbury, New Zealand)
-
Game Audio with FMOD and Unity
Robinson, Ciaran
-
Official (ISC)2 Guide to the CSSLP C...
Beatrica Čulmanová; Danica Pauličková
-
Professional Security Management
Swanson, Charles