2638 search results - page 94 / 528 » Random Geometric Complexes |
121
click to vote
PODC
2009
ACM
16 years 5 months ago
2009
ACM
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
144
click to vote
CRYPTO
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...
136
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
161
click to vote
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
153
click to vote
EUROCRYPT
2012
Springer
13 years 6 months ago
2012
Springer
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...