On the n(log2n) Isomorphism Technique,

Abstract

An algorithm is given for deciding isomorphism of two groups of order n (given as multiplication tables) which runs in 0(n to the (log sub 2 n + 0(1)) power) steps where n is the order of the groups. The fact that a group of n is generated by log n element is used. This technique generalizes to isomorphism of quasigroups, latin squares, and some graphs generated from latin squares.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1977
Accession Number
ADA044439

Entities

People

  • Gary L. Miller

Organizations

  • University of Rochester

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Combinatorial Analysis
  • Computer Science
  • Computers
  • Contracts
  • Decomposition
  • Generators
  • Identities
  • Mathematics
  • New York
  • Permutations
  • Sequences
  • Universities

Fields of Study

  • Mathematics

Readers

  • Linear Algebra
  • Mathematical Modeling and Probability Theory.