Weak containment for partial words is coNP-complete (Q894455)
From MaRDI portal
!
WARNING
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 6515010
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Weak containment for partial words is coNP-complete |
scientific article; zbMATH DE number 6515010 |
Statements
Weak containment for partial words is coNP-complete (English)
0 references
1 December 2015
0 references
computational complexity
0 references
formal languages
0 references
NP-completeness
0 references
partial words
0 references
language containment
0 references
0 references
0.8440023
0 references
0.83475536
0 references
0 references
0.82697004
0 references
0.82697004
0 references
0.8201806
0 references
