Microsoft Research
Microsoft Translator |
Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs

Parikshit Gopalan, Adam Klivans, and Raghu Meka
August 2010

countlearnrobp-Aug 2010.pdf
PDF file

Publisher  ECCC Tech Report

Details

TypeTechReport
NumberMSR-TR-2010-178
Share
Share this page on Facebook
Share this page on Twitter
Share this page on LinkedIn
E-mail this page
RSS feeds
> Publications > Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs