457 search results - page 10 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
ASIACRYPT
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
Boolean functions on the space Fm 2 are not only important in the theory of error-correcting codes, but also in cryptography. In these two cases, the nonlinearity of these functio...
IWPEC
2009
Springer
14 years 1 months ago
2009
Springer
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds or below tight upper bounds. To illustrate the approac...
TCS
2011
13 years 2 months ago
2011
The notion of repetition threshold, which is the object of Dejean’s conjecture (1972), was generalized by Ilie, Ochem, and Shallit in 2005, to include the lengths of the avoided ...
STACS
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...