The NP-completeness column: An ongoing guide
- 30 June 1983
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 4 (2) , 189-203
- https://doi.org/10.1016/0196-6774(83)90045-7
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Parallel Scheduling AlgorithmsOperations Research, 1983
- Scheduling subject to resource constraints: classification and complexityDiscrete Applied Mathematics, 1983
- An Almost-Linear Algorithm for Two-Processor SchedulingJournal of the ACM, 1982
- Parallel Matrix and Graph AlgorithmsSIAM Journal on Computing, 1981
- AlternationJournal of the ACM, 1981
- A parallel algorithm for constructing minimum spanning treesJournal of Algorithms, 1980
- Deadline scheduling of tasks with ready times and resource constraintsInformation Processing Letters, 1979
- Linear programming is log-space hard for PInformation Processing Letters, 1979
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977
- Translational lemmas, polynomial time, and (log n)j-spaceTheoretical Computer Science, 1976