1. Babai, L., and Fortnow, L., A Characterization of $$\mathcal{P}$$ by Arithmetic Straight Line Programs, Proc. 31st annual FOCS Symposium,(1990), 26–34.
2. Lautemann, C., $$\mathcal{B}\mathcal{P}\mathcal{P}$$ and the Polynomial Hierarchy, Information Processing Letters, 17, (1983), 215–217.
3. Ravi Kannan, Venkateswaran, H., Vinay, V., and Yao, A. C., A Circuit-Based Proof of Toda's Theorem, To appear in Information and Computation.
4. Regan, K. W., Royer J. S., A Simpler Proof of $$\mathcal{P}\mathcal{H} \subseteq BP. \oplus \mathcal{P}$$ . Draft, May 1990.
5. Ruzzo, W.L., On Uniform Circuit Complexity, Journal of Computer and System Sciences 22, (1981), 365–383.