Date: 2017-11-11 14:59:54Cryptography Randomized algorithms Computational complexity theory Mathematics Probabilistically checkable proof Complexity classes Interactive proof system IP NP Soundness PCP theorem Commitment scheme | | Taking proof-based verified computation a few steps closer to practicality1 Srinath Setty, Victor Vu, Nikhil Panpalia, Benjamin Braun, Andrew J. Blumberg, and Michael Walfish The University of Texas at Austin Abstract. WAdd to Reading ListSource URL: www.pepper-project.orgDownload Document from Source Website File Size: 434,93 KBShare Document on Facebook
|