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.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Andreas Enge, Pierrick Gaudry (2002)
Acta Arithmetica
Similarity:
M. Fox (1980)
Applicationes Mathematicae
Similarity:
Vijayakumar, A. (1985-1986)
Portugaliae mathematica
Similarity:
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.
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.
I. L. Reilly, M. K. Vamanamurthy (1986)
Matematički Vesnik
Similarity:
Bedřich Pondělíček (1981)
Kybernetika
Similarity: