A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial Space

DOI10.1007/978-3-319-48749-6_45zbMath1486.90165OpenAlexW2539839596MaRDI QIDQ2958350

Noriyuki Fujimoto

Publication date: 1 February 2017

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_45

zbMATH Keywords

combinatorial optimizationgenerating functionexact algorithmspace efficiency

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Cites Work

• Saving space by algebraization
• Fast Multiple-Precision Evaluation of Elementary Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial Space