| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 431255 | The Journal of Logic and Algebraic Programming | 2011 | 9 Pages |
Abstract
A well-known computational approach to finite presentations of infinite groups is the kbmag procedure of Epstein, Holt and Rees. We describe some efficiency issues relating to the procedure and detail two asymptotic improvements: an index for the rewriting system that uses generalized suffix trees and the use of dynamic programming to reduce the number of verification steps.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
