Abstract
In this section we discuss a general notion of generic complexity of algorithms and algorithmic problems. Our exposition here is along the lines of [48].
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). Generic Case Complexity. In: Group-based Cryptography. Advanced Courses in Mathematics - CRM Barcelona. Birkhäuser Basel. https://doi.org/10.1007/978-3-7643-8827-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-7643-8827-0_8
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)