Fast algorithms for abelian periods in words and greatest common divisor queries (Q340577)
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: Fast algorithms for abelian periods in words and greatest common divisor queries |
scientific article; zbMATH DE number 6652748
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for abelian periods in words and greatest common divisor queries |
scientific article; zbMATH DE number 6652748 |
Statements
Fast algorithms for abelian periods in words and greatest common divisor queries (English)
0 references
14 November 2016
0 references
abelian period
0 references
jumbled pattern matching
0 references
greatest common divisor
0 references
0 references
