A Deterministic Polynomial-Time Approximation Scheme for...

SIAM Journal on Computing 2012 / 01 Vol. 41; Iss. 2

A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions

Štefankovič, Daniel, Vempala, Santosh, Vigoda, Eric
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
41
Language:
english
Journal:
SIAM Journal on Computing
DOI:
10.1137/11083976x
Date:
January, 2012
File:
PDF, 183 KB
english, 2012
Conversion to is in progress
Conversion to is failed