The Nature Of Computation - Links

Home | Samples | Teaching | Reviews | Errata | Authors | Links


Insights and Algorithms

Who is the Hardest One of All? NP-Completeness

The Deep Questions: P vs. NP

Grand Unified Theory of Computation

Simply the Best: Optimization

Random Walks and Rapid Mixing

References

Home | Samples | Teaching | Reviews | Errata | Authors | Links

© by Stephan Mertens
URL: http://
updated on Thursday, October 15th 2009, 11:45:43 CET;