Deciding non-emptiness of hypergraph languages generated by connection-preserving fusion grammars is NP-complete (Q2232268)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7405980
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deciding non-emptiness of hypergraph languages generated by connection-preserving fusion grammars is NP-complete |
scientific article; zbMATH DE number 7405980 |
Statements
Deciding non-emptiness of hypergraph languages generated by connection-preserving fusion grammars is NP-complete (English)
0 references
4 October 2021
0 references
