106 search results - page 2 / 22 » Probabilistically Checkable Arguments |
GI
1995
Springer
14 years 3 days ago
1995
Springer
ECCC
2007
13 years 8 months ago
2007
AC
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. In the late 80's Blum, Luby, Rubinfeld, Kannan et al. pioneered the theory of self
CTRSA
2012
Springer
12 years 4 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...
ISTCS
1995
Springer
14 years 3 days ago
1995
Springer
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary function to a lowdegree polynomial. Each rule depends on the function’s value...