Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
{HO02} L. Hemaspaandra and M. Ogihara. The Complexity Theory Companion. EATCS Texts in Theoretical Computer Science. Springer-Verlag, Berlin, Heidelberg, New York, 2002.
3
{May04} A. May. Computing the RSA secret key is deterministic polynomial time equivalent to factoring. In Advances in Cryptology --- CRYPTO '04, pages 213--219. Springer-Verlag Lecture Notes in Computer Science #3152, 2004.
4
{Pap94} C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.