On the computational complexity of a merge recognition problem (Q1170032)
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: On the computational complexity of a merge recognition problem |
scientific article; zbMATH DE number 3782380
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of a merge recognition problem |
scientific article; zbMATH DE number 3782380 |
Statements
On the computational complexity of a merge recognition problem (English)
0 references
1983
0 references
polynomial time algorithm
0 references
