The hardness of counting full words compatible with partial words (Q1936243)
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 6138136
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The hardness of counting full words compatible with partial words |
scientific article; zbMATH DE number 6138136 |
Statements
The hardness of counting full words compatible with partial words (English)
0 references
21 February 2013
0 references
partial words
0 references
NP-completeness
0 references
\(\#\)P complexity class
0 references
\(\#\)P-complete problems
0 references
combinatorics on words
0 references
0.9465264081954956
0 references
0.7812063097953796
0 references
0.7528956532478333
0 references
0.7505419850349426
0 references
0.7457193732261658
0 references
