Back to Results
—out of 5—out of 5—out of 5—out of 5—out of 5—out of 5
Magical Tome
- First published
- 2001
- Publisher
- Springer
- Pages
- 492 pages
- ISBN
- 9783540668602
Algorithmics for Hard Computing Problems
The outer archives are busy
About this book
This textbook provides a "cheap ticket" to the design of algorithms for hard computing problems, i.e., for problems for which no low-degree polynomial-time algorithms are known.
Match Score
Create a free account to see Match Scores on books the community has marked — once you’ve set your preferences.
Create free accountMarks of the Realm
Marks left by readers of this tome
No community marks yet — be the first to inscribe this tome.
Pacing
Horror / Dark Elements
Romance
Spice Level
LGBTQ+ Representation
Social & Political Themes in Stories