Fr. 150.00

Istvan Miklos, Istvan (Renyi Institute Miklos, Miklos Istvan

Computational Complexity of Counting and Sampling

English · Paperback / Softback

Shipping usually within 1 to 3 weeks (not available at short notice)

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.

Summary

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.

Product details

Authors	Istvan Miklos, Istvan (Renyi Institute Miklos, Miklos Istvan
Publisher	Taylor & Francis Ltd.

Languages	English
Product format	Paperback / Softback
Released	20.02.2019

EAN	9781138035577
ISBN	978-1-138-03557-7
No. of pages	408
Series	Discrete Mathematics and Its Applications
Subjects	Natural sciences, medicine, IT, technology > Mathematics > General, dictionaries MATHEMATICS / General, MATHEMATICS / Combinatorics, MATHEMATICS / Arithmetic, algorithms and data structures, Algorithms & data structures, Combinatorics & graph theory, Combinatorics and graph theory

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.