Back to Results
First PageMeta Content
Cryptography / 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. W
Add to Reading List

Document Date: 2017-11-11 14:59:54


Open Document

File Size: 434,93 KB

Share Result on Facebook
UPDATE