Please use this identifier to cite or link to this item:
|Title:||Automorphisms of finite rings and applications to complexity of problems||Authors:||Agrawal, M.
|Issue Date:||2005||Citation:||Agrawal, M.,Saxena, N. (2005). Automorphisms of finite rings and applications to complexity of problems. Lecture Notes in Computer Science 3404 : 1-17. ScholarBank@NUS Repository.||Abstract:||An important role played by automorphisms of algebraic structures in mathematics is discussed. Automorphisms capture the symmetries inherent in the structures and many important results have been proved by analyzing the automorphism group of the structure. Automorphisms also play a very important role in computer science specially in the finite rings because a number of algebraic problems reduce to questions about automorphisms and isomorphisms of finite rings. Automorphisms and isomorphisms of finite rings also have a number of useful applications in the complexity theory as well.||Source Title:||Lecture Notes in Computer Science||URI:||http://scholarbank.nus.edu.sg/handle/10635/40728||ISSN:||03029743|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 22, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.