Hard counting problems for partial words (Q3564883)
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: Hard counting problems for partial words |
scientific article; zbMATH DE number 5712486
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hard counting problems for partial words |
scientific article; zbMATH DE number 5712486 |
Statements
Hard Counting Problems for Partial Words (English)
0 references
26 May 2010
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.8131760358810425
0 references
0.792316734790802
0 references
0.7921719551086426
0 references
0.7855899333953857
0 references
