Check nearby libraries
Buy this book
![Loading indicator](/images/ajax-loader-bar.gif)
This edition doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
![Loading indicator](/images/ajax-loader-bar.gif)
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?History
- Created April 30, 2008
- 12 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
July 13, 2024 | Edited by MARC Bot | import existing book |
December 29, 2021 | Edited by ImportBot | import existing book |
September 10, 2020 | Edited by MARC Bot | import existing book |
August 3, 2020 | Edited by MARC Bot | add LCCN |
April 30, 2008 | Created by an anonymous user | Imported from amazon.com record |