1. The complexity of sparse sets in P;Allender,1986
2. Counting classes: threshold, parity, mods, and fewness;Beigel,1990
3. Predicate classes and promise classes;Borchert,1994
4. A uniform approach to define complexity classes;Bovet;Theoret. Comput. Sci.,1992
5. Using inductive counting to simulate nondeterministic computation;Buntrock;Inform. Comput.,1993