Editing Probabilistically checkable proof (section)

== References ==
{{Reflist|refs=

<ref name=ab07>{{citation
 | last1 = Arora | first1 = Sanjeev | author1-link = Sanjeev Arora
 | last2 = Barak | first2 = Boaz
 | isbn = 978-0-521-42426-4
 | page = 241
 | publisher = [[Cambridge University Press]]
 | title = Computational Complexity: A Modern Approach
 | url = https://books.google.com/books?id=8Wjqvsoo48MC&pg=PA241
 | year = 2007}}</ref>

<ref name=almss>{{citation
 | last1 = Arora | first1 = Sanjeev | author1-link = Sanjeev Arora
 | last2 = Lund | first2 = Carsten | author2-link = Carsten Lund
 | last3 = Motwani | first3 = Rajeev | author3-link = Rajeev Motwani
 | last4 = Sudan | first4 = Madhu | author4-link = Madhu Sudan
 | last5 = Szegedy | first5 = Mario | author5-link = Mario Szegedy
 | doi = 10.1145/278298.278306
 | issue = 3
 | journal = [[Journal of the ACM]]
 | pages = 501–555
 | title = Proof verification and the hardness of approximation problems
 | volume = 45
 | year = 1998 | s2cid = 8561542 }}</ref>

<ref name=as92>{{citation
 | last1 = Arora | first1 = Sanjeev | author1-link = Sanjeev Arora
 | last2 = Safra | first2 = Shmuel | author2-link = Shmuel Safra
 | doi = 10.1145/273865.273901
 | issue = 1
 | journal = [[Journal of the ACM]]
 | pages = 70–122
 | title = Probabilistic checking of proofs: A new characterization of NP
 | volume = 45
 | year = 1998| s2cid = 751563 | doi-access = free
 }}</ref>

<ref name=bfl90>{{citation
 | last1 = Babai | first1 = László | author1-link = László Babai
 | last2 = Fortnow | first2 = Lance | author2-link = Lance Fortnow
 | last3 = Lund | first3 = Carsten | author3-link = Carsten Lund
 | contribution = Nondeterministic exponential time has two-prover interactive protocols
 | doi = 10.1109/FSCS.1990.89520
 | title = Proceedings of the 31st Annual Symposium on Foundations of Computer Science (FOCS 1990)
 | pages = 16–25 | year = 1990| isbn = 978-0-8186-2082-9 | citeseerx = 10.1.1.130.9311 | s2cid = 38429596 }}</ref>

}}