✦ LIBER ✦

Storage allocation is NP-hard

✍ Scribed by J.M. Robson

Book ID: 113162249
Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 868 KB
Volume: 11
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(80)90124-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Terrain Guarding is NP-Hard

✍ King, James; Krohn, Erik 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 310 KB

GPSG-Recognition Is NP-Hard

✍ Eric Sven Ristad 📂 Article 📅 1987 🏛 MIT Press 🌐 English ⚖ 763 KB

Allocating hard real-time tasks: An NP-H

Allocating hard real-time tasks: An NP-Hard problem made easy

✍ K. W. Tindell; A. Burns; A. J. Wellings 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 1004 KB

A distributed hard real time system can be composed from a number of communicating tasks. One of the difficulties with building such systems is the problem of where to place the tasks. In general there are pr ways of allocating Ttasks to P processors, and the problem of finding an optimal feasible a

NP-hard sets are superterse unless NP is

NP-hard sets are superterse unless NP is small

✍ Yongge Wang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 517 KB

Recognizing tough graphs is NP-hard

✍ D. Bauer; S.L. Hakimi; E. Schmeichel 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 326 KB

Diagonal matrix scaling is NP-hard

✍ Leonid Khachiyan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 217 KB