Computational Complexity of Counting and Sampling
Available on compatible , the free NOOK App, and in My Digital Library
NOOK App
Download NOOK app
NOOK Devices
NOOK eReaders
- NOOK GlowLight 4 Plus
- NOOK GlowLight 4e
- NOOK GlowLight 4
- NOOK GlowLight Plus 7.8"
- NOOK GlowLight 3
- NOOK GlowLight Plus 6"
NOOK Tablets
- NOOK 9" Lenovo Tablet
- NOOK 10" HD Lenovo Tablet
- NOOK Tablet 7" & 10.1"
- NOOK by Samsung Galaxy Tab 7.0 [Tab A and Tab 4]
- NOOK by Samsung [Tab 4 10.1, S2 & E]
Free NOOK Reading Apps
- NOOK for iOS
- NOOK for Android
BN.com website
Go to your Digital Library in My Account
Computational Complexity of Counting and Sampling provides readers with comprehensive and detailed coverage of the subject of computational complexity. It is primarily geared toward researchers in enumerative combinatorics, discrete mathematics, and theoretical computer science.
The book covers the following topics: Counting and sampling problems that are solvable in polynomial running time, including holographic algorithms; #P-complete counting problems; and approximation algorithms for cou...























