Free Shipping to all UK customers for orders over £25.00

0 Total items on my wish-list.

Free Shipping to all UK customers for orders over £25.00

Ryefieldbooks Logo

Ryefield Books

Free Shipping to all UK customers for orders over £25.00

Ryefieldbooks Logo

Ryefield Books

Contact Us
[email protected]
© Copyright Ryefield Books - All Right Reserved
Product Categories
My Shopping Cart
Void image

You shopping cart is empty

You may browse our offerings to locate what you're
searching for, then put it in your shopping cart.

Book cover image

Computational Complexity of Counting and Sampling

Usually dispatched within 3 - 5 business days.

In Stock (625)

£ 121.49

Description

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.

Book Details
EAN:
9781138035577
Binding:
Paperback / softback
Dimensions(mm):
158 x 233 x 23
Publication Date:
2019-02-20
Publication Country:
United Kingdom