Elementary net synthesis remains NP-complete even for extremely simple inputs (Q2280178)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Elementary net synthesis remains NP-complete even for extremely simple inputs |
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
