Succinct delegation for low-space non-deterministic computation

STOC '18: Symposium on Theory of Computing Los Angeles CA USA June, 2018, pp. 709-721, 2018.

Cited by: 10|Bibtex|Views89|DOI:https://doi.org/10.1145/3188745.3188924
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|dl.acm.org

Abstract:

We construct a delegation scheme for verifying non-deterministic computations, with complexity proportional only to the non-deterministic space of the computation. Specifically, letting n denote the input length, we construct a delegation scheme for any language verifiable in non-deterministic time and space (T(n), S(n)) with communicatio...More

Code:

Data:

Your rating :
0

 

Tags
Comments