Efficiency issues in the kbmag procedure |
| |
| Authors: | Jerry Swan |
| |
| Affiliation: | Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science, University of Nottingham, Jubilee Campus, Wollaton Road, Nottingham NG8 1BB, UK |
| |
| 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. |
| |
| Keywords: | MSC 2000: Primary 08-04 Secondary 68-04 |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
