Computational Complexity of Counting and Sampling - Discrete Mathematics and Its Applications - Miklos, Istvan (Renyi Institute, Budapest, Hungary) - Books - Taylor & Francis Ltd - 9781138035577 - February 20, 2019
In case cover and title do not match, the title is correct

Miklos, Istvan (Renyi Institute, Budapest, Hungary)
Computational Complexity of Counting and Sampling - Discrete Mathematics and Its Applications 1st edition

Price
HK$ 1,099
excl. VAT

Ordered from remote warehouse

Expected to be ready for shipping Jul 22 - Aug 3
Get notified about new Miklos, Istvan (Renyi Institute, Budapest, Hungary) releases

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

Not rated yet

Also available as:

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.

378 pages, 3 Tables, black and white; 34 Illustrations, black and white

Media Books     Paperback Book   (Book with soft cover and glued back)
Released February 20, 2019
ISBN13 9781138035577
Publishers Taylor & Francis Ltd
Pages 408
Dimensions 233 × 158 × 23 mm   ·   600 g
Language English  

More from the same publisher

See all of Miklos, Istvan (Renyi Institute, Budapest, Hungary) ( e.g. Paperback Book and Hardcover Book )