On computational complexity of Siegel Julia sets (Q984472): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Mark Braverman / rank
Normal rank
 
Property / author
 
Property / author: Michael Yampolsky / rank
Normal rank
 
Property / author
 
Property / author: Mark Braverman / rank
 
Normal rank
Property / author
 
Property / author: Michael Yampolsky / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q122442267 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3098936822 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0502354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5823651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Filled Julia sets with empty interior are computable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parabolic Julia sets are polynomial time computable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-computable Julia sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5179742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Brjuno function continuously estimates the size of quadratic Siegel disks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3779480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4328166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Brjuno functions and their regularity properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-similarity of Siegel disks and Hausdorff dimension of Julia sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of some julia sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variation of the conformal radius / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration of analytic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mating Siegel quadratic polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858757 / rank
 
Normal rank

Latest revision as of 01:10, 3 July 2024

scientific article
Language Label Description Also known as
English
On computational complexity of Siegel Julia sets
scientific article

    Statements

    On computational complexity of Siegel Julia sets (English)
    0 references
    0 references
    0 references
    0 references
    19 July 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references