Sciweavers

ALGORITHMICA
2008
56views more  ALGORITHMICA 2008»
13 years 9 months ago
Eliminating Cycles in the Discrete Torus
In this paper we consider the following question: how many vertices of the discrete torus must be deleted so that no topologically nontrivial cycles remain? We look at two differe...
Béla Bollobás, Guy Kindler, Imre Lea...
CRYPTO
2000
Springer
145views Cryptology» more  CRYPTO 2000»
14 years 1 months ago
Nonlinearity Bounds and Constructions of Resilient Boolean Functions
In this paper we investigate the relationship between the nonlinearity and the order of resiliency of a Boolean function. We first prove a sharper version of McEliece theorem for ...
Palash Sarkar, Subhamoy Maitra