Computational Complexity of Counting and Sampling

Contact
Newsletter

Newsletter Sign in for news and special offers information. Data Administrator: ABE-IPS Sp. z o.o.

Choose interesting categories

I have read and agree to Privacy Policy and Newsletter Terms
I agree to receive promotional electronic communication(s).
Unsubscribe
Institutional Clients
Delivery
About us

Computational Complexity of Counting and Sampling

Authors	Istvan Miklos
Publisher	Taylor & Francis Ltd
Year	20/02/2019
Pages	390
Version	paperback
Readership level	General/trade
Language	English
ISBN	9781138035577
Categories	Combinatorics & graph theory

$115.26 (with VAT)

512.40 PLN / €109.86 / £95.37

Delivery to United States

check shipping prices

Product to order

Delivery 3-4 weeks

Add to bookshelf

Book 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.

Computational Complexity of Counting and Sampling

Bookstore

Computational Complexity of Counting and Sampling

Book description

We also recommend books

Pseudo-Matroids & Cuts of Matroids

Absolute Arithmetic and F1-Geometry

A Brief Introduction to Spectral Graph Theory

Plus 1: The Introductory Coaching System..

Perform with Time: The One-to-one Coaching..

Mathematics, Game Theory & Algebra..

Information Path Functional & Informational..

Brain Teasers Mathematics: 100 Puzzles with..