|Title:||A 'Hard-Core' Randomized Theorem For Algorithms
|Authors:||Shimon Even and Yacov Yacobi
|Abstract:||Lynch proved that if a decision problem A is not solvable in polynomial time then there exists an infinte recursive subset X of its domain on which the decision is almost everywhere complex. We prove a similar result for a common class of randomized algorithms.|
|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/1980/CS/CS0188), 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 1980
To the main CS technical reports page
Computer science department, Technion