<--- Back to Details
First PageDocument Content
University of New South Wales / Quantum nanoscience / British people / Physics / Alexander R. Hamilton / Science and technology in the United Kingdom / Michael Pepper
Date: 2011-11-01 04:21:24
University of New South Wales
Quantum nanoscience
British people
Physics
Alexander R. Hamilton
Science and technology in the United Kingdom
Michael Pepper

ALEXANDER RUDOLF HAMILTON

Add to Reading List

Source URL: www.phys.unsw.edu.au

Download Document from Source Website

File Size: 372,33 KB

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

Cryptography / Distributed computing architecture / Parallel computing / MapReduce / Certificate / IP / NP / Commitment scheme / PP / Computational complexity theory

Verifying computations with state Benjamin Braun, Ariel J. Feldman⋆ , Zuocheng Ren, Srinath Setty, Andrew J. Blumberg, and Michael Walfish The University of Texas at Austin ⋆ University of Pennsylvania Abstract When

DocID: 1xVGQ - View Document

Efficient RAM and control flow in verifiable outsourced computation Riad S. Wahby⋆ , Srinath Setty† , Zuocheng Ren† , Andrew J. Blumberg† , and Michael Walfish⋆ ⋆ †

DocID: 1xVic - View Document

Cryptography / Computational complexity theory / Randomized algorithms / Complexity classes / Probabilistically checkable proof / Proof theory / IP / NP / NEXPTIME / Soundness / PCP theorem / Commitment scheme

Making Argument Systems for Outsourced Computation Practical (Sometimes) Srinath Setty, Richard McPherson, Andrew J. Blumberg, and Michael Walfish The University of Texas at Austin Abstract This paper describes the desig

DocID: 1xV3q - View Document

Cryptography / Computational complexity theory / Complexity classes / Public-key cryptography / Interactive proof system / NP / NEXPTIME / IP / Probabilistically checkable proof / Commitment scheme / Proof of secure erasure / Randomized algorithm

Toward practical and unconditional verification of remote computations Srinath Setty∗, Andrew J. Blumberg∗, and Michael Walfish∗ 1 Introduction

DocID: 1xUS0 - View Document