"A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack ..."

Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda (2012)

> Home

Details and statistics

DOI: 10.1137/11083976X

access: closed

type: Journal Article

metadata version: 2019-10-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/StefankovicVV12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/StefankovicVV12
Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda:
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions. SIAM J. Comput. 41(2): 356-366 (2012)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.