On the complexity of project scheduling to minimize exposed time (Q2514874): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Quicksort / rank | |||
Normal rank | |||
Revision as of 06:14, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of project scheduling to minimize exposed time |
scientific article |
Statements
On the complexity of project scheduling to minimize exposed time (English)
0 references
4 February 2015
0 references
complexity theory
0 references
project scheduling
0 references
secret project
0 references
NP-complete
0 references
polynomial algorithm
0 references
