A general framework for subexponential discrete logarithm algorithms
Andreas Enge, Pierrick Gaudry (2002)
Acta Arithmetica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On tameness and growth conditions.”
A general framework for subexponential discrete logarithm algorithms
Duels with possibly asymmetric goals
M. Fox (1980)
Applicationes Mathematicae
Similarity:
Some properties of the discrete holometric space
Vijayakumar, A. (1985-1986)
Portugaliae mathematica
Similarity:
On the genericity of the observability of controlled discrete-time systems
Sabeur Ammar, Jean-Claude Vivalda (2010)
ESAIM: Control, Optimisation and Calculus of Variations
Similarity:
In this paper, we prove the genericity of the observability for discrete-time systems with more outputs than inputs.
Exponentials Form a Basis of Discrete Holomorphic Functions on a Compact
Christian Mercat (2004)
Bulletin de la Société Mathématique de France
Similarity:
We show that discrete exponentials form a basis of discrete holomorphic functions on a finite critical map. On a combinatorially convex set, the discrete polynomials form a basis as well.
On spaces in which every denumerable subspaces is discrete
I. L. Reilly, M. K. Vamanamurthy (1986)
Matematički Vesnik
Similarity:
On compositional and convolutional discrete systems
Bedřich Pondělíček (1981)
Kybernetika
Similarity: