|Title:||Towards a Theory of Average Case Complexity
|Abstract:||The purpose of this manuscript is to provide a survey of basic notions and results concerning a theory average case complexity initiated by Leonid Levin.
This survey is mainly based on Levin's paper "Average Case complete Problems" [L], and expositions of it due to Johnson [J], Gurevich and McCauley [GMc]. Further developments due to Gurevich [G] and others are also briefly discussed.
This is a preliminary version of the survey. I am aware of some improvements in presentation which I did not implement yet. So I'd like to apologize to the reader for presenting him with something I know to be less than good. Nevertheless, comments are most welcome.
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1988/CS/CS0531), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1988
To the main CS technical reports page
Computer science department, Technion