Abstract
One of the aims of the section is to set up a framework that would allow one to analyze behavior of algorithms at large, to study expected or average properties of algorithms, or its behavior on “most” inputs. The key point here is to equip algorithmic problems with probability distributions on their sets of instances.
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). Distributional Problems and the Average-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_7
Download citation
DOI: https://doi.org/10.1007/978-3-7643-8827-0_7
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)