A note on the complexity of a partition algorithm

DOI10.1016/0020-0190(83)90049-2zbMath0531.68022OpenAlexW2084120288MaRDI QIDQ788493

Leon Pesotchinsky, Vladimir Lifschitz

Publication date: 1983

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90049-2

zbMATH Keywords

analysis of algorithmspartition problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial aspects of partitions of integers (05A17) Discrete mathematics in relation to computer science (68R99)

Cites Work

• Unnamed Item
• Unnamed Item
• A Tauberian theorem for partitions
• The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms
• Hard Knapsack Problems
• The Efficiency of an Algorithm of Integer Programming: A Probabilistic Analysis
• Computing Partitions with Applications to the Knapsack Problem
• Determining the Stability Number of a Graph
• Determining the Chromatic Number of a Graph

This page was built for publication: A note on the complexity of a partition algorithm