Storage allocation is NP-hard

DOI10.1016/0020-0190(80)90124-6zbMath0449.68012OpenAlexW2123918639MaRDI QIDQ1147512

John Michael Robson

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1016/0020-0190(80)90124-6

zbMATH Keywords

NP hardstorage allocationallocation strategy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Data structures (68P05)

Related Items (1)

Storage allocation is NP-hard

Cites Work

• Unnamed Item
• Unnamed Item
• Storage allocation is NP-hard
• A dynamic storage allocation problem
• GO Is Polynomial-Space Hard
• Bounds for Some Functions Concerning Dynamic Storage Allocation

This page was built for publication: Storage allocation is NP-hard