An edition of Randomness and Completeness in Computational Complexity
(2001)
Randomness and Completeness in Computational Complexity
1 edition
by Dieter van Melkebeek
Share
×Close
Last edited by AMillarBot
January 8, 2011 | History
This edition doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
Previews available in: English
Showing 1 featured edition. View all 1 editions?
| Edition | Availability |
|---|---|
1
Randomness and Completeness in Computational Complexity
January 25, 2001, Springer
Paperback
in English
- 1 edition
3540414924 9783540414926
|
aaaa
Libraries near you:
WorldCat
|
Book Details
First Sentence
"How can we solve a problem using computers in a reasonable amount of time?"
Edition Notes
Lecture Notes in Computer Science
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?
| January 8, 2011 | Edited by AMillarBot | move edition notes from title to notes field (Lecture Notes in Computer Science) |
| April 28, 2010 | Edited by Open Library Bot | Linked existing covers to the work. |
| December 10, 2009 | Created by WorkBot | add works page |