88 search results - page 9 / 18 » Computing automorphisms of semigroups |
110
Voted
CORR
2008
Springer
15 years 17 days ago
2008
Springer
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...
99
Voted
FCT
2007
Springer
15 years 4 months ago
2007
Springer
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...
141
Voted
CSR
2008
Springer
15 years 2 months ago
2008
Springer
We offer cryptanalysis of a key exchange scheme due to Stickel [11], which was inspired by the well-known Diffie-Hellman protocol. We show that Stickel's choice of platform (t...
DCC
2003
IEEE
16 years 2 days ago
2003
IEEE
We show that 40 is the maximum number of points of a cap in AG(4, 4). Up to semi-linear transformations there is only one such 40-cap. Its group of automorphisms is a semidirect p...
108
Voted
JSC
2010
14 years 11 months ago
2010
We describe an algorithm for computing automorphism groups and testing isomorphisms of finite dimensional Lie algebras over finite fields. The algorithm is particularly effect...