Finding a homomorphism between two words is NP-complete (Q599499)
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: Finding a homomorphism between two words is NP-complete |
scientific article; zbMATH DE number 3644480
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a homomorphism between two words is NP-complete |
scientific article; zbMATH DE number 3644480 |
Statements
Finding a homomorphism between two words is NP-complete (English)
0 references
1979
0 references
Np-complete
0 references
computational complexity
0 references
formal language
0 references
nonerasing homomorphism
0 references
