71 search results - page 1 / 15 » Automorphisms of Finite Rings and Applications to Complexity... |
STACS
2005
Springer
15 years 6 months ago
2005
Springer
125
Voted
CC
2006
Springer
15 years 14 days ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
93
Voted
COCOON
2006
Springer
15 years 4 months ago
2006
Springer
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...
91
Voted
BSL
2000
15 years 8 days ago
2000
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
131
Voted
ICISC
2000
15 years 1 months ago
2000
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...