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 the normal view instead:
scientific article; zbMATH DE number 3782380
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
