Sudan, M. (1995). Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems. Springer-Verlag Association for Computing Machinery.
Chicago Style (17th ed.) CitationSudan, Madhu. Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems. Berlin New York: Springer-Verlag Association for Computing Machinery, 1995.
MLA (8th ed.) CitationSudan, Madhu. Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems. Springer-Verlag Association for Computing Machinery, 1995.
Warning: These citations may not always be 100% accurate.
