The balance problem of min-max systems is co-nNP hard (Q2503672): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q977006 |
Changed an Item |
||
| Property / author | |||
| Property / author: Qian-Chuan Zhao / rank | |||
Normal rank | |||
Revision as of 17:29, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The balance problem of min-max systems is co-nNP hard |
scientific article |
Statements
The balance problem of min-max systems is co-nNP hard (English)
0 references
21 September 2006
0 references
Discrete event systems
0 references
min-max systems
0 references
Cycle time
0 references
Balance condition
0 references
Monotone Boolean functions
0 references
co-NP hard
0 references
