Sciweavers

94 search results - page 3 / 19
» Linear Systems over Finite Abelian Groups
Sort
View
EUROCRYPT
2005
Springer
13 years 11 months ago
The RSA Group is Pseudo-Free
We prove, under the strong RSA assumption, that the group of invertible integers modulo the product of two safe primes is pseudo-free. More specifically, no polynomial time algor...
Daniele Micciancio
SIAMADS
2010
114views more  SIAMADS 2010»
13 years 15 days ago
The Abelian Hopf H mod K Theorem
We study the symmetries of periodic solutions from Hopf bifurcation in systems with finite abelian symmetries. Our main result, the Abelian Hopf H mod K Theorem, gives necessary a...
Natasha Filipski, Martin Golubitsky
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
14 years 6 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
AAECC
1997
Springer
99views Algorithms» more  AAECC 1997»
13 years 10 months ago
Extension Theorems for Linear Codes over Finite Rings
Various forms of the extension problem are discussed for linear codes de ned over nite rings. The extension theorem for symmetrized weight compositions over nite Frobenius rings is...
Jay A. Wood
ALGORITHMICA
1999
123views more  ALGORITHMICA 1999»
13 years 5 months ago
Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields
We describe a coarse-grain parallel software system for the homogeneous solution of linear systems. Our solutions are symbolic, i.e., exact rather than numerical approximations. O...
Erich Kaltofen, A. Lobo