Computational Complexity Of Counting And Sampling
Sale

Computational Complexity Of Counting And Sampling

Taylor & Francis Ltd
SKU:
9781138035577
|
UPC:
9781138035577
$94.99 $92.45
(No reviews yet)
Condition:
New
Current Stock:
Adding to cart… The item has been added
Description
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.


  • | By (Author): Istvan Miklos
  • | Publisher: Taylor & Francis Ltd
  • | Publication Date: Feb 20, 2019
  • | Country of Publication: United Kingdom
  • | Number of Pages: 390 pages
  • | Language: Unknown
  • | Binding: Softback
  • | ISBN-10: 1138035572
  • | ISBN-13: 9781138035577
Additional Information
By (Author):
Istvan Miklos
Publisher:
Taylor & Francis Ltd
Publication Date:
Feb 20, 2019
Country of Publication:
United Kingdom
Language:
Unknown
Number of pages:
390 pages
Binding:
Softback
ISBN-10:
1138035572
ISBN-13:
9781138035577