CC
2016
Springer
8 years 8 months ago
2016
Springer
Goldreich, Sahai, and Vadhan (CRYPTO 1999) proved that the promise problem for estimating the Shannon entropy of a distribution sampled by a given circuit is NISZK-complete. We co...
CC
2016
Springer
8 years 8 months ago
2016
Springer
CC
2016
Springer
8 years 8 months ago
2016
Springer
The PCP theorem (Arora et. al., J. ACM 45(1,3)) asserts the existence of proofs that can be verified by reading a very small part of the proof. Since the discovery of the theorem...
CC
2016
Springer
8 years 8 months ago
2016
Springer
Abstract. We study worst-case complexity assumptions that imply quantum bitcommitment schemes. First we show that QSZK ⊆ QMA implies a computationally hiding and statistically bi...
CC
2016
Springer
8 years 8 months ago
2016
Springer
The choice of data structures is crucial for achieving high performance. For applications that are long-running and/or operate on large data sets, the best choice for main data st...
CC
2016
Springer
8 years 8 months ago
2016
Springer
Given an LR(1) automaton, what are the states in which an error can be detected? For each such “error state”, what is a minimal input sentence that causes an error in this sta...
109
click to vote
CC
2016
Springer
8 years 8 months ago
2016
Springer
This paper presents SVF, a tool that enables scalable and precise interprocedural Static Value-Flow analysis for C programs by leveraging recent advances in sparse analysis. SVF, ...
CC
2016
Springer
8 years 8 months ago
2016
Springer
CC
2016
Springer
8 years 8 months ago
2016
Springer
The performance of OpenCL programs suffers from memory and control flow divergence. Therefore, OpenCL compilers employ static analyses to identify non-divergent control flow and...
CC
2016
Springer
8 years 8 months ago
2016
Springer
Developing an optimizing compiler backend remains a laborious process, especially for nontraditional ISAs that have been appearing recently. Superoptimization sidesteps the need f...