Accession Number:

ADA053246

Title:

The Complexity of Word and Isomorphism Problems for Finite Groups.

Descriptive Note:

Technical rept.,

Corporate Author:

YALE UNIV NEW HAVEN CONN DEPT OF COMPUTER SCIENCE

Report Date:

1977-03-01

Pagination or Media Count:

6.0

Abstract:

The uniform word problem for finite groups presented by their multiplication tables is considered. Upper bounds of 0k-squared for arbitrary group and 0n log-squared n for arbitrary semigroup and 0n log n for abelian groups are shown where n is the length of the presentation. Author

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE