Paper Info
Title
Efficiency issues in the kbmag procedure
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.
Year
DOI
Venue
2011
10.1016/j.jlap.2010.11.001
The Journal of Logic and Algebraic Programming
Keywords
Field
DocType
Primary 08-04,Secondary 68-04
Discrete mathematics,Dynamic programming,Programming language,Suffix,Computer science,Theoretical computer science,Rewriting
Journal
Volume
Issue
ISSN
80
8
1567-8326
Citations 
PageRank 
References 
0
0.34
4
Authors
1
Name
Order
Citations
PageRank
Jerry Swan119619.47