Theory of Semi-Feasible Algorithms
Our rough guess is there are 37,250 words in this book.
At a pace averaging 250 words per minute, this book will take 2 hours and 29 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
- Torenvliet, Leen - Contributor
Publication
2003 - Springer Berlin Heidelberg, Berlin, Heidelberg, Germany
Language
English
Word Count
37,250 words, Guess
Page Count
149 pages
Physical Format
Electronic resource
Identifiers
- Open LibraryOL27091793M
- ISBN-139783642075810
- ISBN-103642075819
- OCLC Control Number851374397
Classifications
- DDC005.1
- LCCQA76.9.A43
- LCCQA75.5-76.95
Description
This book presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream perfectly showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. Research into semi-feasible computation has already developed a rich set of tools, yet is young enough to have an abundance of fresh, open issues. Being essentially self-contained, the book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science in general. Newcomers are introduced to the field systematically and guided to the frontiers of current research. Researchers already active in the field will appreciate the book as a valuable source of reference.
Series Statement
- Monographs in Theoretical Computer Science An EATCS Series
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!