Termination for a class of algorithms for constructing algebras given by generators and relations

1997

Presented at the Algorithms for algebra, Eindhoven

Additional Metadata
MSC	Explicit machine computation and programs (not the theory of computation or programming) (msc 17-04), None of the above, but in MSC2010 section 17Bxx (msc 17B99)
Publisher	North-Holland
Journal	Journal of Pure and Applied Algebra
Conference	Algorithms for algebra
Citation APA APA Style APA-ALL Style AAA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	van Leeuwen, M.& Roelofs, M. (1997). Termination for a class of algorithms for constructing algebras given by generators and relations. Journal of Pure and Applied Algebra, (117/118), 431–445.

Publication