Elementary net synthesis remains NP-complete even for extremely simple inputs (Q2280178)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Elementary net synthesis remains NP-complete even for extremely simple inputs |
scientific article |
Statements
Elementary net synthesis remains NP-complete even for extremely simple inputs (English)
0 references
18 December 2019
0 references
