Storage allocation is NP-hard

DOI10.1016/0020-0190(80)90124-6MaRDI QIDQ1147512zbMATH OpenOpenAlexFDO

Authors 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

allocation strategyNP hardstorage allocation

Mathematics Subject Classification ID

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

Cites work

• A dynamic storage allocation problem
• Bounds for Some Functions Concerning Dynamic Storage Allocation
• GO Is Polynomial-Space Hard
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Storage allocation is NP-hard

Cited in

(1)

• Storage allocation is NP-hard

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1147512)