Storage allocation is NP-hard (English)
National licence
- New search for: Robson, J.M.
- New search for: Robson, J.M.
In:
Information Processing Letters
;
11
, 3
;
119-125
;
1980
-
ISSN:
- Article (Journal) / Electronic Resource
-
Title:Storage allocation is NP-hard
-
Contributors:Robson, J.M. ( author )
-
Published in:Information Processing Letters ; 11, 3 ; 119-125
-
Publisher:
-
Publication date:1980-08-11
-
Size:7 pages
-
ISSN:
-
DOI:
-
Type of media:Article (Journal)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents – Volume 11, Issue 3
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 115
-
A note on preemptive scheduling of periodic, real-time tasksLeung, Joseph Y.-T. / Merrill, M.L. et al. | 1980
- 119
-
Storage allocation is NP-hardRobson, J.M. et al. | 1980
- 126
-
Comments on a lower bound for convex hull determinationAvis, David et al. | 1980
- 127
-
A note on grammatical coversMoura, Arnaldo et al. | 1980
- 130
-
Fast string searching by finding subkeys in subtextBailey, Thomas A. / Geoff Dromey, R. et al. | 1980
- 134
-
Shortest-path problem is not harder than matrix multiplicationRomani, Francesco et al. | 1980
- 137
-
Internal merge sorting with delayed selectionErkiö, Hannu et al. | 1980
- 141
-
The Schorr-Waite marking algorithm revisitedDershowitz, Nachum et al. | 1980
- 144
-
On inclusion problem for deterministic multitape automataKinber, E.B. et al. | 1980