Abstract
In all instances, if not said otherwise, we use Turing machines as our principal model of computation. In this section we briefly recall some basic definitions and notation concerning Turing machines that are used throughout this chapter.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Birkhäuser Verlag
About this chapter
Cite this chapter
(2008). Background on Computational Complexity. In: Group-based Cryptography. Advanced Courses in Mathematics - CRM Barcelona. Birkhäuser Basel. https://doi.org/10.1007/978-3-7643-8827-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-7643-8827-0_3
Publisher Name: Birkhäuser Basel
Print ISBN: 978-3-7643-8826-3
Online ISBN: 978-3-7643-8827-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)