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

On the complexity of a family related to the Legendre symbol

โœ Scribed by Katalin Gyarmati


Publisher
Springer Netherlands
Year
2009
Tongue
English
Weight
129 KB
Volume
58
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A note on the complexity of family sched
โœ T. C. Edwin Cheng; Zhaohui Liu; Yakov M. Shafransky ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Springer US ๐ŸŒ English โš– 65 KB ๐Ÿ‘ 2 views

The single-machine family scheduling problem of minimizing the number of late jobs has been known to be NP-hard, but whether it is NP-hard in the strong sense is cited as an open problem in several reviews. In this note, we prove that this problem is strongly NP-hard even if all set-up times and pro