Citation: H. Vollmer et Kw. Wagner, RECURSION THEORETIC CHARACTERIZATIONS OF COMPLEXITY CLASSES OF COUNTING FUNCTIONS, Theoretical computer science, 163(1-2), 1996, pp. 245-258
Citation: P. Enjalbert et al., SELECTED PAPERS OF THE 11TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER-SCIENCE (STACS-94), CAEN, FRANCE, 24-26 FEBRUARY 1994, Theoretical computer science, 148(2), 1995, pp. 181-181
Citation: Rv. Book et al., AN OBSERVATION ON PROBABILITY VERSUS RANDOMNESS WITH APPLICATIONS TO COMPLEXITY CLASSES, Mathematical systems theory, 27(3), 1994, pp. 201-209