Fast algorithms for abelian periods in words and greatest common divisor queries (Q340577)

From MaRDI portal
Revision as of 23:22, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fast algorithms for abelian periods in words and greatest common divisor queries
scientific article

    Statements

    Fast algorithms for abelian periods in words and greatest common divisor queries (English)
    0 references
    0 references
    0 references
    0 references
    14 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    abelian period
    0 references
    jumbled pattern matching
    0 references
    greatest common divisor
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references