Computational Complexity of Counting and Sampling

Name: Computational Complexity of Counting and Sampling
Brand: Taylor & Francis Ltd
SKU: 9781138035577
Price: 17800 KES
Availability: OutOfStock
ISBN: 9781138035577

by Istvan Miklos

Book Details

Format Paperback / softback

Book Series Discrete Mathematics and Its Applications

ISBN-10 1138035572

ISBN-13 9781138035577

Publisher Taylor & Francis Ltd

Imprint CRC Press

Country of Manufacture GB

Country of Publication GB

Publication Date Feb 20th, 2019

Print length 408 Pages

Weight 600 grams

Dimensions 15.80 x 23.30 x 2.30 cms

Product Classification: Combinatorics & graph theory Combinatorics and graph theory Algorithms & data structures Algorithms and data structures

KSh 17,800.00

Currently unavailable 0 in stock

Delivery Location

County

Location

Delivery fee: Select location

Secure

Quality

Fast

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.

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.

Get Computational Complexity of Counting and Sampling by Istvan Miklos at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Taylor & Francis Ltd and it has 408 pages.