Efficient Algorithms for Listing Combinatorial Structures (Distinguished Dissertations in Computer Science)
Our rough guess is there are 45,000 words in this book.
At a pace averaging 250 words per minute, this book will take 3 hours and 0 minutes to read. With a half hour per day, this will take 6 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
Publication
2009-07-30 - Cambridge University Press
Word Count
45,000 words, Guess
Page Count
180 pages
Identifiers
- Internet Archiveefficientalgorit00gold_953
- ISBN-100521117887
- ISBN-139780521117883
- Better World Books9780521117883
- Open LibraryOL26798555M
Classifications
- LCCQA76.9.A43 G65 1993
Subjects
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!