Weak Completeness in E and E 2

@inproceedings{Juedesy1995WeakCI,
  title={Weak Completeness in E and E 2},
  author={David W. Juedesy and Jack H. LutzDepartment},
  year={1995}
}
  • David W. Juedesy, Jack H. LutzDepartment
  • Published 1995
The notions of weak P m-completeness for the complexity classes E = DTIME(2 linear) and E 2 = DTIME(2 polynomial) are compared. An element C of one of these classes is weakly P m-complete for the class if the set P m (C), consisting of all languages A P m C, does not have measure 0 in the class. The following two results are proven.