Boekhandel Douwes Den Haag

Discrete Mathematics and Its Applications

Computational Complexity of Counting and Sampling

Istvan (Renyi Institute Miklos

Computational Complexity of Counting and Sampling

Discrete Mathematics and Its Applications

Computational Complexity of Counting and Sampling

Discrete Mathematics and Its Applications: Computational Complexity of Counting and Sampling

 

"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.


Levertijd: 5 tot 8 werkdagen

€ 112,00

Levertijd: 5 tot 8 werkdagen


Beschrijving Discrete Mathematics and Its Applications: Computational Complexity of Counting and Sampling

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.


ISBN
9781138035577
Pagina's
408
Verschenen
Serie
Discrete Mathematics and Its Applications
Rubriek
Wiskunde algemeen
Druk
1
Uitvoering
Paperback
Taal
Engels
Uitgever
Taylor & Francis Ltd

Wiskunde algemeen