The complexity of Dehn's algorithm for word problems in groups (Q3718927)

From MaRDI portal
Revision as of 23:01, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of Dehn's algorithm for word problems in groups
scientific article

    Statements

    title
    The complexity of Dehn's algorithm for word problems in groups (English)
    0 references
    author
    Michael Anshel
    0 references
    publication date
    1985
    0 references
    zbMATH Keywords
    Dehn's algorithm
    0 references
    Turing machine
    0 references
    word problem
    0 references
    DA-group
    0 references

    Identifiers

    Mathematics Subject Classification ID
    20F10
    0 references
    03D15
    0 references
    03D40
    0 references
    zbMATH DE Number
    3948588
    0 references
    OpenAlex ID
    W1972468537
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3718927&oldid=32297018"
    Powered by MediaWiki