21 search results - page 1 / 5 » Local Decoding and Testing for Homomorphisms |
APPROX
2006
Springer
14 years 2 months ago
2006
Springer
STOC
2004
ACM
14 years 11 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
CRYPTO
2008
Springer
14 years 19 days ago
2008
Springer
In this paper we introduce the notion of a Public-Key Encryption Scheme that is also a Locally-Decodable Error-Correcting Code (PKLDC). In particular, we allow any polynomialtime ...
CSR
2008
Springer
14 years 19 days ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
PPSN
1998
Springer
14 years 3 months ago
1998
Springer
Several methods have been proposed for handling nonlinear constraints by evolutionary algorithms for numerical optimization problems; a survey paper [7] provides an overview of var...