Check nearby libraries
Buy this book
This edition doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
Subjects
Computational complexityShowing 1 featured edition. View all 1 editions?
Edition | Availability |
---|---|
1
Completeness and Reduction in Algebraic Complexity Theory (Algorithms and Computation in Mathematics)
July 26, 2000, Springer
Hardcover
in English
- 1 edition
3540667520 9783540667520
|
aaaa
Libraries near you:
WorldCat
|
Book Details
First Sentence
"Computational complexity theory provides a framework for understanding the cost required to solve algorithmic problems."
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?July 28, 2020 | Edited by MARC Bot | import existing book |
April 28, 2010 | Edited by Open Library Bot | Linked existing covers to the work. |
December 10, 2009 | Created by WorkBot | add works page |