articole
(gol)
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...
citește totul
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--
ascunde descrierea
- Editură: Taylor & Francis Ltd
- Cod:
- Anul publicării: 2019
- Limba: Engleză
- Legarea: Broșată
- Număr de pagini: 390
- Lățimea ambalajului: 23.3 cm
- Înălțimea ambalajului: 15.8 cm
- Adâncimea ambalajului: 2.3 cm
- Greutatea ambalajului: 600 g
Recenzii