Jump to ContentJump to Main Navigation
The Theory of Infinite Soluble Groups$
Users without a subscription are not able to see the full content.
The Theory of Infinite Soluble Groups

John C. Lennox and Derek J. S. Robinson

Print publication date: 2004

Print ISBN-13: 9780198507284

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198507284.001.0001

ALGORITHMIC THEORIES OF FINITELY GENERATED SOLUBLE GROUPS

Chapter:
(p. 158 ) 9 ALGORITHMIC THEORIES OF FINITELY GENERATED SOLUBLE GROUPS
Source:
The Theory of Infinite Soluble Groups
Author(s):

John C. Lennox

Derek J. S. Robinson

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198507284.003.0009

This chapter discusses the word, generalized word, and conjugacy problems; algorithmic problems for polycyclic groups; soluble minimax groups; finitely generated metabelian groups; and submodule computability.

Keywords:   conjugacy problems, algorithmic problems, soluble minimax groups, finitely generated metabelian groups, submodule computability

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .