Computational complexity of Euclidean sets
hyperbolic Julia sets are poly-time computable.
Our rough guess is there are 22,500 words in this book.
At a pace averaging 250 words per minute, this book will take 1 hours and 30 minutes to read. With a half hour per day, this will take 3 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Word Count
22,500 words, Guess
Page Count
90 pages
Identifiers
- ISBN-100612952649
- ISBN-139780612952645
- Open LibraryOL22624942M
Description
We apply the concepts developed to show that hyperbolic Julia sets are polynomial time computable. This result is a significant generalization of the result in [RW03], where polynomial time computability has been shown for a restricted type of hyperbolic Julia sets.We investigate different definitions of the computability and complexity of sets in Rk , and establish new connections between these definitions. This allows us to connect the computability of real functions and real sets in a new way. We show that equivalence of some of the definitions corresponds to equivalence between famous complexity classes. The model we use is mostly consistent with [Wei00].
Subjects
Links
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!