7 search results - page 1 / 2 » micrOMEGAs: Version 1.3 |
CPHYSICS
2006
13 years 4 months ago
2006
COCOON
2010
Springer
13 years 9 months ago
2010
Springer
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...
ASIACRYPT
2007
Springer
13 years 10 months ago
2007
Springer
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
FSTTCS
2009
Springer
13 years 9 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
ECCC
2011
12 years 11 months ago
2011
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...