Completeness and Reduction in Algebraic Complexity Theory (Algorithms and Computation in Mathematics)
1 edition
Our rough guess is there are 42,000 words in this book.
At a pace averaging 250 words per minute, this book will take 2 hours and 48 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.
Word Count
42,000 words, Guess
Page Count
168 pages
Physical Format
Hardcover
Identifiers
- Open LibraryOL9063174M
- ISBN-139783540667520
- ISBN-103540667520
- OCLC Control Number43648697
- Library of Congress Control Number00029647
and 2 more
- Goodreads5751205
- LibraryThing8099322
Classifications
- LCCQA267.7 .B88 2000
Description
"The theory of NP-completeness is a cornerstone of computational complexity. This monograph provides a thorough and comprehensive treatment of this concept in the framework of algebraic complexity theory. Many of the results presented are new and published for the first time. Topics include: complete treatment of Valiant's algebraic theory of NP-completeness, interrelations with the classical theory as well as the Blum-Shub-Smale model of computation, questions of structural complexity, fast evaluation of representations of general linear groups, and complexity of immanants. The book can be used at the advanced undergraduate or at the beginning graduate level in either mathematics or computer science."--BOOK JACKET.
First Sentence
Computational complexity theory provides a framework for understanding the cost required to solve algorithmic problems.
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!