Abstract
How can we solve a problem using computers in a reasonable amount of time? Computational complexity studies the inherent difficulty of problems and the power of the tools we may engage to solve them.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
van Melkebeek, D. (2000). 1. Introduction. In: Randomness and Completeness in Computational Complexity. Lecture Notes in Computer Science, vol 1950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44545-5_1
Download citation
DOI: https://doi.org/10.1007/3-540-44545-5_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41492-6
Online ISBN: 978-3-540-44545-6
eBook Packages: Springer Book Archive