Name
Abstract | ||
|---|---|---|
We study the complexity of the isomorphism and automorphism problems for finite rings with unity. We show that both integer factorization and graph isomorphism reduce to the problem of counting automorphisms of rings. The problem is shown to be in the ... |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/CCC.2005.2 | SIAM J. Comput. |
Keywords | DocType | Volume |
preprocessing,private information retrieval,partial derivatives | Conference | 37 |
Issue | ISSN | ISBN |
009 | 1093-0159 | 0-7695-2364-1 |
Citations | PageRank | References |
31 | 1.50 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| David P. Woodruff | 1 | 2156 | 142.38 |
| Sergey Yekhanin | 2 | 983 | 52.33 |