On the complexity of deciding avoidability of sets of partial words (Q606993): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2010.09.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2129749965 / rank | |||
Normal rank | |||
Revision as of 21:02, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of deciding avoidability of sets of partial words |
scientific article |
Statements
On the complexity of deciding avoidability of sets of partial words (English)
0 references
19 November 2010
0 references
computational complexity
0 references
combinatorics on words
0 references
partial words
0 references
unavoidable sets
0 references
NP-hard problems
0 references
de Bruijn graphs
0 references
