A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy
type: Item
instance of: scholarly article
title: A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy
zbMATH Open document ID: 1348.68295
author: Nir Halman
published in: Theoretical Computer Science
publication date: 2016-08-31T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6620938
zbMATH Keywords: approximate counting
zbMATH Keywords: integer knapsack
zbMATH Keywords: dynamic programming
zbMATH Keywords: binding constraints
zbMATH Keywords: \(K\)-approximating sets and functions
MaRDI profile type: Publication
full work available at URL: j.tcs.2016.06.015
OpenAlex ID: W2424560073
cites work: A deterministic polynomial-time approximation scheme for counting knapsack solutions
cites work: Approximate counting by dynamic programming
cites work: Q3976517
cites work: An FPTAS for #Knapsack and Related Counting Problems
cites work: Pseudorandom generators for polynomial threshold functions
cites work: Faster FPTASes for Counting and Random Generation of Knapsack Solutions
cites work: A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
cites work: Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs
DOI: 10.1016/J.TCS.2016.06.015
description: scientific article; zbMATH DE number 6620938