Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
29
click to vote
FOCM
2007
favorite
Email
discuss
report
83
views
more
FOCM 2007
»
Filled Julia Sets with Empty Interior Are Computable
13 years 10 months ago
Download
www.math.toronto.edu
We show that if a polynomial filled Julia set has empty interior, then it is computable.
Ilia Binder, Mark Braverman, Michael Yampolsky
Real-time Traffic
Computable
|
Empty
|
FOCM 2007
|
Polynomial filled Julia
|
claim paper
Related Content
»
Constructing noncomputable Julia sets
»
Noncomputable Julia sets
»
Views of Fibonacci dynamics
»
Conservative volumetric visibility with occluder fusion
»
A Volumetric Method for Building Complex Models from Range Images
more »
Post Info
More Details (n/a)
Added
14 Dec 2010
Updated
14 Dec 2010
Type
Journal
Year
2007
Where
FOCM
Authors
Ilia Binder, Mark Braverman, Michael Yampolsky
Comments
(0)
Researcher Info
FOCM 2002 Study Group
Computer Vision