Zusammenfassung
This volume contains contributions by the participants of the conference "e;Groups and Computation"e;, which took place at The Ohio State University in Columbus, Ohio, in June 1999. This conference was the successor of two workshops on "e;Groups and Computation"e; held at DIMACS in 1991 and 1995. There are papers on permutation group algorithms, finitely presented groups, polycyclic groups, and parallel computation, providing a representative sample of the breadth of Computational Group Theory. On the other hand, more than one third of the papers deal with computations in matrix groups, giving an in-depth treatment of the currently most active area of the field. The points of view of the papers range from explicit computations to group-theoretic algorithms to group-theoretic theorems needed for algorithm development.
This volume contains contributions by the participants of the conference "e;Groups and Computation"e;, which took place at The Ohio State University in Columbus, Ohio, in June 1999. This conference was the successor of two workshops on "e;Groups and Computation"e; held at DIMACS in 1991 and 1995. There are papers on permutation group algorithms, finitely presented groups, polycyclic groups, and parallel computation, providing a representative sample of the breadth of Computational Group Theory. On the other hand, more than one third of the papers deal with computations in matrix groups, giving an in-depth treatment of the currently most active area of the field. The points of view of the papers range from explicit computations to group-theoretic algorithms to group-theoretic theorems needed for algorithm development.
Titel
La sociologie du temps libre: Problèmes et perspectives
Untertitel
Contribution à une définition du champ détude
Autor
EAN
9783110872767
Format
E-Book (pdf)
Hersteller
Genre
Veröffentlichung
20.02.2019
Digitaler Kopierschutz
Wasserzeichen
Anzahl Seiten
410
Auflage
Reprint 2018
Lesemotiv
Unerwartete Verzögerung
Ups, ein Fehler ist aufgetreten. Bitte versuchen Sie es später noch einmal.