Part of the book series:Lecture Notes in Computer Science ((LNCS,volume 1367))
878Accesses
8Citations
This is a preview of subscription content,log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
- Thomas Jansen
Search author on:PubMed Google Scholar
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag
About this chapter
Cite this chapter
Jansen, T. (1998). Introduction to the theory of complexity and approximation algorithms. In: Mayr, E.W., Jürgen Prömel, H., Steger, A. (eds) Lectures on Proof Verification and Approximation Algorithms. Lecture Notes in Computer Science, vol 1367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053011
Download citation
Published:
Publisher Name:Springer, Berlin, Heidelberg
Print ISBN:978-3-540-64201-5
Online ISBN:978-3-540-69701-5
eBook Packages:Springer Book Archive
Share this chapter
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.