On an algorithm for enumerating generating sets of modules over Euclidean domains

dc.contributor.author	Waldhausen, Maja Wanda Maria	en
dc.coverage.spatial	xvii, 185 p : ill. 30 cm.	en
dc.date.accessioned	2021-04-08T09:15:12Z
dc.date.available	2021-04-08T09:15:12Z
dc.date.issued	2006
dc.identifier.uri	https://hdl.handle.net/10023/22505
dc.language.iso	en	en
dc.publisher	University of St Andrews	en
dc.subject.lcc	QA174.2W2
dc.subject.lcsh	Group theory--Generators	en
dc.subject.lcsh	Algorithms	en
dc.title	On an algorithm for enumerating generating sets of modules over Euclidean domains	en
dc.type	Thesis	en
dc.type.qualificationlevel	Doctoral	en
dc.type.qualificationname	PhD Doctor of Philosopy	en
dc.publisher.institution	The University of St Andrews	en
dc.contributor.institution	Mathematics & Statistics Theses	en