MathSciNet Relay Station
MathSciNet bibliographic data
MR2089735 68Q15
Sudan, Madhu Probabilistically checkable proofs. Computational complexity theory, 349–389, IAS/Park City Math. Ser., 10, Amer. Math. Soc., Providence, RI, 2004.
Links to the journal or article are not yet available
For users without a MathSciNet license , Relay Station allows linking from MR numbers in online mathematical literature directly to electronic journals and original articles. Subscribers receive the added value of full MathSciNet reviews.

Username/Password Subscribers access MathSciNet here

AMS Home Page

American Mathematical Society American Mathematical Society
201 Charles Street
Providence, RI 02904-6248 USA
© Copyright 2017, American Mathematical Society
Privacy Statement