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

First Page		Document Content
Date: 2017-11-11 14:59:54 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 Source URL: www.pepper-project.org Download Document from Source Website File Size: 434,93 KB Share Document on Facebook

	Lebesgue density and Π01 Classes Mushfeq Khan University of Hawai‘i at M¯anoa Algorithmic Randomness and Complexity Shonan Village Center September 12th, 2014 DocID: 1ubuP - View Document
	Rademacher Complexity Margin Bounds for Learning with a Large Number of Classes Vitaly Kuznetsov Courant Institute of Mathematical Sciences, 251 Mercer street, New York, NY, 10012 Mehryar Mohri DocID: 1t1hx - View Document
	Principles of metabolism: coping with complexity Six classes of enzymes DocID: 1sh47 - View Document
	Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester DocID: 1ruap - View Document
	The complexity of positive first-order logic without equality II: The four-element case Barnaby Martin1? and Jos Martin2 1 School of Engineering and Computing Sciences, Durham University, DocID: 1rtIQ - View Document