๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Space-time isomorphism problem is intractable (NP-hard)

โœ Scribed by Vladik Kreinovich

Publisher
Springer
Year
1991
Tongue
English
Weight
451 KB
Volume
30
Category
Article
ISSN
0020-7748

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The STO-problem is NP-hard
The STO-problem is NP-hard
โœ Krzysztof R. Apt; Peter van Emde Boas; Angelo Welling ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 209 KB

A finite set of term equations \(E\) is called subject to the occur-check (STO) if a sequence of actions of the Martelli-Montanari unification algorithm starts with \(E\) and ends with a failure due to occur-check. We prove here that the problem of deciding whether \(E\) is STO is NP-hard.

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