The word problem for \(1\mathcal{LC}\) congruences is NP-hard. (Q1426452)
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: The word problem for \(1\mathcal{LC}\) congruences is NP-hard. |
scientific article; zbMATH DE number 2056799
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The word problem for \(1\mathcal{LC}\) congruences is NP-hard. |
scientific article; zbMATH DE number 2056799 |
Statements
The word problem for \(1\mathcal{LC}\) congruences is NP-hard. (English)
0 references
14 March 2004
0 references
Generalization of Mazurkiewicz traces
0 references
NP-hardness
0 references
0 references
0.7533784508705139
0 references
0.7483937740325928
0 references
0.7234814167022705
0 references
0.7228384613990784
0 references
