^J. Gill, "Computational complexity of probabilistic Turing machines." SIAM Journal on Computing, 6 (4), pp. 675–695, 1977.
參考資料编辑
Papadimitriou, C. chapter 11. Computational Complexity. Addison-Wesley. 1994..
Allender, E. A note on uniform circuit lower bounds for the counting hierarchy. Proceedings 2nd International Computing and Combinatorics Conference (COCOON). Lecture Notes in Computer Science 1090. Springer-Verlag. 1996: 127–135..
Burtschick, Hans-Jörg; Vollmer, Heribert. Lindström Quantifiers and Leaf Language Definability. 1999. Template:ECCC..