Home > Computers > Computer Science > Theoretical > Complexity Theory > Publications
Books, eprints, journals, magazines, newsletters, preprints, etc on Algorithmic Complexity.
http://www.nada.kth.se/~viggo/approxbook/
Combinatorial optimization problems and their approximability properties: by G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi (Springer, 1999). Table of contents, errata, software supplement and a continuously updated catalog of approximability results.
http://link.springer.com/journal/37
(Birkhäuser) Tables of contents from vol.7 (1998) on. Full text to subscribers via LINK.
http://bruce.edmonds.name/combib/
Bruce Edmonds; Manchester Metropolitan University.
Home > Computers > Computer Science > Theoretical > Complexity Theory > Publications
Thanks to DMOZ, which built a great web directory for nearly two decades and freely shared it with the web. About us