Näita mobiiliversiooni

Liigu sisu juurde Liigu peamenüü juurde

Home / Books / Science / Physics and Mathematics / Computational Complexity of Counting and Sampling

Book

Computational Complexity of Counting and Sampling

Author: Istvan Miklos (Renyi Institute, Budapest, Hungary)

* * * * * * * * * * Rate and Review (0)

117.70 111.82 €Last copies

Delivery: With fast shipping: saturday 22.06

Description

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

Technical information
ISBN 9781138035577
Published: 2019
Language In English
Format Soft cover
Pages 390 pg
Publisher Taylor & Francis Ltd
sari Discrete Mathematics and Its Applications
Added: 11.03.2019

117.70 111.82 €Last copies

Delivery: With fast shipping: saturday 22.06

Category TOP

Reviews (0)
  • To submit a review, please log in

Reviews from social networks

Vabandame! Teie veebilehitseja on liiga väike meie kodulehe külastamiseks.

We're sorry! Your browser is too small for this website.

Приносим извинения! Размеры вашего браузера слишком малы для посещения нашей страницы.