<--- Back to Details
First PageDocument Content
Vrije / VU
Date: 2012-05-22 10:55:16
Vrije
VU

VU UNIVERSITY AMSTERDAM 2 PRESENTATION OUTLINE VU Responsiveness

Add to Reading List

Source URL: www.rockinst.org

Download Document from Source Website

File Size: 3,63 MB

Share Document on Facebook

Similar Documents

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

DocID: 1xVQw - View Document

Algebra / Polynomial / RASAT / Inequality / NP-complete problems

raSAT: SMT for Polynomial Inequality To Van Khanh (UET/VNU-HN) Vu Xuan Tung, Mizuhito Ogawa (JAIST

DocID: 1xVsE - View Document

Computational complexity theory / Logic / Mathematics / Randomized algorithms / Automated theorem proving / Logic programming / Probabilistically checkable proof / IP / NP / Substitution / MAX-3SAT / operator

Resolving the conflict between generality and plausibility in verified computation Srinath Setty? , Benjamin Braun? , Victor Vu? , Andrew J. Blumberg? , Bryan Parno† , and Michael Walfish? ? The University of Texas at

DocID: 1xUGv - View Document

A hybrid architecture for interactive verifiable computation Victor Vu, Srinath Setty, Andrew J. Blumberg, and Michael Walfish The University of Texas at Austin questions of the prover, and applies efficient tests to the

DocID: 1xTfa - View Document

PDF Document

DocID: 1xS7i - View Document