8 search results - page 1 / 2 » Constructing non-computable Julia sets |
STOC
2007
ACM
14 years 5 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
CG
2007
Springer
13 years 4 months ago
2007
Springer
The Binet formula provides a mechanism for the Fibonacci numbers to be viewed as a function of a complex variable. The Binet formula may be generalized by using other bases and mu...
MFCS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...