Showing papers on "Average-case complexity published in 1970"

Recursive properties of abstract complexity classes (Preliminary Version)

Abstract: It is proven that complexity classes of abstract measures of complexity need not be recursively enumerable. However, the complement of each class is r.e. Properties of effective enumerations of complexity classes are studied. For any measure there is another measure with 'almost' the same complexity classes such that almost every class admits an effective enumeration in terms of speedy devices. Finally complexity classes are shown to not be closed under intersection.

Three measures of decoder complexity

Abstract: Three measures of the complexity of error correcting decoders are considered, namely, logic complexity, computation time and computational work (the number of logical operations). Bounds on the complexity required with each measure to decode with probability of error Pe, at code rate R are given and the complexity of a number of ad hoc decoding procedures is examined.