TWO CONP-COMPLETE SCHEDULE ANALYSIS PROBLEMS (Q5249280): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q128392224, #quickstatements; #temporary_batch_1723507444692 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / cites work | |||
| Property / cites work: Optimal Preemptive Scheduling on Two-Processor Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: NP-complete scheduling problems / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0129054101000667 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2056155753 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128392224 / rank | |||
Normal rank | |||
Latest revision as of 09:24, 13 August 2024
scientific article; zbMATH DE number 6432503
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | TWO CONP-COMPLETE SCHEDULE ANALYSIS PROBLEMS |
scientific article; zbMATH DE number 6432503 |
Statements
TWO CONP-COMPLETE SCHEDULE ANALYSIS PROBLEMS (English)
0 references
30 April 2015
0 references
task-graph scheduling
0 references
strong sense NP-complete
0 references
deadline analysis
0 references
computational complexity
0 references
3-SAT
0 references
