Hypercomplex iterations
distance estimation and higher dimensional fractals
Our rough guess is there are 36,000 words in this book.
At a pace averaging 250 words per minute, this book will take 2 hours and 24 minutes to read. With a half hour per day, this will take 5 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.
Author
Contributions
- Kauffman, Louis H., 1945- - Contributor
- Sandin, Daniel J. - Contributor
Publication
2002 - World Scientific, River Edge, NJ, New Jersey
Language
English
Word Count
36,000 words, Guess
Page Count
144 pages
Identifiers
- Internet Archivehypercomplexiter00dang
- Internet Archivehypercomplexiter00dang_454
- Internet Archivehypercomplexiter00dang_826
- ISBN-109810232969
- ISBN-139789810232962
and 6 more
- LibraryThing6961455
- Goodreads558145
- Library of Congress Control Number2003545471
- OCLC Control Number50850764
- Better World Books9789810232962
- Open LibraryOL3778593M
Classifications
- LCCQA297.8 .D25 2002
- LCCQA297.8.D25 2002
Alternate Titles
- Distance estimation and higher dimensional fractals
Series Statement
- K & E series on knots and everything ;
- v. 17
Other Editions
- Hypercomplex iterations: distance estimation and higher dimensional fractals
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!