CiteSeer.IST HomeCheck: The following citations are predicted to all refer to the same paper. Details
O. Goldreich. A taxonomy of proof systems. In L. A. Hemaspaandra and A. L. Selman, editors, Complexity Theory Retrospective II, pages 109--134. Springer Verlag, 1997.
O. Goldreich. A taxonomy of proof systems. In L. Hemaspaandra and A. Selman, editors, Complexity Theory Retrospective II, pages 109-134. SpringerVerlag, 1997.
O. Goldreich. A taxonomy of proof systems. In L. A. Hemaspaandra and A. L. Selman, editors, Complexity Theory Retrospective II, pages 109-134. Springer Verlag, 1997.
O. Goldreich. A Taxonomy of Proof Systems. In Complexity Theory Retrospective II, L.A. Hemaspaandra and A. Selman (eds.), Springer-Verlag, New York, 1997.
O. Goldreich. A Taxonomy of Proof Systems. In Complexity Theory Retrospective II, L.A. Hemaspaandra and A. Selman (eds.), Springer-Verlag, New York, 1997.
O. Goldreich. A Taxonomy of Proof Systems. In Complexity Theory Retrospective II, L.A. Hemaspaandra and A. Selman (eds.), Springer-Verlag, New York, 1997.
O. Goldreich. A taxonomy of proof systems. In L. A. Hemaspaandra and A. L. Selman, editors, Complexity Theory Retrospective II, pages 109--134. Springer Verlag, 1997. 93] U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, and K. W. Wagner. On the power of polynomial time bit-reductions. In Proceedings 8th Structure in Complexity Theory, pages 200-- 207, 1993.