Pages that link to "Item:Q984472"

The following pages link to On computational complexity of Siegel Julia sets (Q984472):

Displaying 2 items.

• Computability of Brolin-Lyubich measure (Q651408) (← links)
• Almost every real quadratic polynomial has a poly-time computable Julia set (Q1785010) (← links)