The Complexity of Word and Isomorphism Problems for Finite Groups.
Abstract
The uniform word problem for finite groups presented by their multiplication tables is considered. Upper bounds of 0(k-squared) for arbitrary group and 0(n log-squared n) for arbitrary semigroup and 0(n log n) for abelian groups are shown where n is the length of the presentation. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1977
- Accession Number
- ADA053246
Entities
People
- Lawrence H Snyder
- Richard J. Lipton
- Y. Zalcstein
Organizations
- Yale University