On computational complexity of Siegel Julia sets (Q984472)

From MaRDI portal
Revision as of 01:10, 3 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
On computational complexity of Siegel Julia sets
scientific article

    Statements

    title
    On computational complexity of Siegel Julia sets (English)
    0 references
    author
    Ilia A. Binder
    0 references
    Mark Braverman
    0 references
    Michael Yampolsky
    0 references
    publication date
    19 July 2010
    0 references
    Mathematics Subject Classification ID
    68Q17
    0 references
    03F60
    0 references
    37F10
    0 references
    37F50
    0 references
    zbMATH DE Number
    5757700
    0 references
    Wikidata QID
    Q122442267
    0 references
    OpenAlex ID
    W3098936822
    0 references
    arXiv ID
    math/0502354
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q984472&oldid=35178951"
    Powered by MediaWiki