Complexity of Makanin's algorithm (Q4371685)

From MaRDI portal
Revision as of 23:08, 5 November 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128392129, #quickstatements; #temporary_batch_1730844495191)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1106119
Language Label Description Also known as
English
Complexity of Makanin's algorithm
scientific article; zbMATH DE number 1106119

    Statements

    title
    Complexity of Makanin's algorithm (English)
    0 references
    author
    Antoni Kościelski
    0 references
    Leszek Pacholski
    0 references
    publication date
    22 January 1998
    0 references
    zbMATH Keywords
    diophantine equation
    0 references
    periodicity
    0 references
    nonnumerical algorithms
    0 references
    word-unification algorithms
    0 references

    Identifiers

    DOI
    10.1145/234533.234543
    0 references
    zbMATH DE Number
    1106119
    0 references
    OpenAlex ID
    W2054924158
    0 references
    Wikidata QID
    Q128392129
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4371685&oldid=37872259"
    Powered by MediaWiki