48 search results - page 3 / 10 » Probabilistically Checkable Proofs and Applications |
145
click to vote
CTRSA
2012
Springer
13 years 8 months ago
2012
Springer
We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state...
RSA
2006
15 years 10 days ago
2006
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining ...
STOC
2009
ACM
16 years 1 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
112
click to vote
ECCC
2011
14 years 3 months ago
2011
The last two decades have seen enormous progress in the development of sublinear-time algorithms — i.e., algorithms that examine/reveal properties of “data” in less time tha...
109
Voted
SIAMCOMP
1998
15 years 2 days ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...