A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword
2007
Computational Complexity
Average-case complexity, which examines the tractability of computational problems on 'random instances,' is a major topic in complexity theory with at least two distinct motivations. On one hand, it may provide a more realistic model than worst-case complexity for the problem instances actually encountered in practice. On the other hand, it provides us with methods to generate hard instances, allowing us to harness intractability for useful ends such as cryptography and derandomization. These
doi:10.1007/s00037-007-0232-y
fatcat:ngds2ex4njfyfaza2xcqqqbx3y