5230 search results - page 6 / 1046 » Dynamic Optimality -- Almost |
IJCGA
2010
13 years 6 months ago
2010
NETWORKS
2010
13 years 5 months ago
2010
CORR
2010
Springer
13 years 4 months ago
2010
Springer
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
FSE
1999
Springer
13 years 11 months ago
1999
Springer
We study the functions from Fm 2 into Fm 2 for odd m which oppose an optimal resistance to linear cryptanalysis. These functions are called almost bent. It is known that almost ben...