𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Inverse NP Problems

✍ Scribed by Hubie Chen


Book ID
105768069
Publisher
Springer
Year
2008
Tongue
English
Weight
302 KB
Volume
17
Category
Article
ISSN
1016-3328

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


NP-complete scheduling problems
✍ J.D. Ullman πŸ“‚ Article πŸ“… 1975 πŸ› Elsevier Science 🌐 English βš– 423 KB

We show that the problem of finding an optimal schedule for a set of jobs is NPcomplete even in the following two restricted cases. (1) All jobs require one time unit. (2) All jobs require one or two time units, and there are only two processor resolving (in the negative a conjecture of R. L. Grah

Complete problems for monotone NP
✍ Iain A. Stewart πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 768 KB
Inverse Stefan problems
✍ N. L. Gol'dman πŸ“‚ Article πŸ“… 1993 πŸ› Springer US 🌐 English βš– 404 KB