NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 1 of 1 (0.132 seconds)

Spelling suggestions: "subject:"infinite presentations"" "subject:"lnfinite presentations""

1

Computation with finitely L-presented groups / Algorithmen für endlich L-präsentierte Gruppen

Hartung, René 01 June 2012 (has links)
No description available.
510 Mathematik
ECAF 050
ECAF 100
ECAE 070
ECA 040
Mathematics and Computer Science
Unendliche Präsentationen
rekursive Präsentationen
L-Präsentationen
Untergruppen endlichen Index
Algorithmen
selbstähnliche Gruppen
Grigorchuk Gruppe.
Infinite presentations
recursive presentations
L-presentations
finite index subgroups
algorithms
self-similar groups
Grigorchuk group
31.21

Page generated in 0.1347 seconds