4047 search results - page 421 / 810 » The Discrete Basis Problem |
159
click to vote
ASIACRYPT
2000
Springer
15 years 11 months ago
2000
Springer
A discrete-logarithm algorithm is called generic if it does not exploit the specific representation of the cyclic group for which it is supposed to compute discrete logarithms. Su...
174
Voted
FM
1999
Springer
15 years 11 months ago
1999
Springer
Timed Communicating Object Z (TCOZ) combines Object-Z's strengths in modeling complex data and algorithms with Timed CSP's strengths in modeling real-time concurrency. TC...
182
click to vote
STACS
1999
Springer
15 years 11 months ago
1999
Springer
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the ...
187
click to vote
ACCV
1998
Springer
15 years 11 months ago
1998
Springer
One of the important problems related to image analysis and compression is finding repeated structure. Although the focus of this paper is developing digital geometric models and m...
144
click to vote
KES
1998
Springer
15 years 11 months ago
1998
Springer
Attractor systems are useful in neurodynamics,mainly in the modelingof associative memory. Thispaper presentsa complexity theory for continuous phase space dynamical systems with ...