- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783540549550
3540549552
9780387549552
0387549552
- Dimensions
-
25 cm
- Extent
-
XII, 238 S.
- Language
-
Deutsch
- Notes
-
graph. Darst.
- Bibliographic citation
-
Lecture notes in computer science ; 559
- Keyword
-
Permutationsgruppe
Algorithmus
- Event
-
Veröffentlichung
- (where)
-
Berlin, Heidelberg, New York, London, Paris, Tokyo, Hong Kong, Barcelona, Budapest
- (who)
-
Springer
- (when)
-
1991
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 1:59 PM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Butler, Gregory
- Springer
Time of origin
- 1991
Other Objects (12)
Permutation groups
Algorithms for polycyclic groups
Normalisers of primitive permutation groups
Representations of permutation groups, 2.
Notes on infinite permutation groups
Homotopy sequence for fundamental groups
Homotopy Sequence for Fundamental Groups
Examples of highly transitive permutation groups
New algorithms for finite Abelian groups
A Heuristic to Accelerate In-situ Permutation Algorithms
Blowups, slicings and permutation groups in combinatorial topology
Fundamental algorithms for a declarative pattern matching system
Permutation groups
Algorithms for polycyclic groups
Normalisers of primitive permutation groups
Representations of permutation groups, 2.
Notes on infinite permutation groups
Homotopy sequence for fundamental groups
Homotopy Sequence for Fundamental Groups
Examples of highly transitive permutation groups
New algorithms for finite Abelian groups
A Heuristic to Accelerate In-situ Permutation Algorithms
Blowups, slicings and permutation groups in combinatorial topology
Fundamental algorithms for a declarative pattern matching system
Permutation groups
Algorithms for polycyclic groups
Normalisers of primitive permutation groups
Representations of permutation groups, 2.
Notes on infinite permutation groups
Homotopy sequence for fundamental groups
Homotopy Sequence for Fundamental Groups
Examples of highly transitive permutation groups
New algorithms for finite Abelian groups
A Heuristic to Accelerate In-situ Permutation Algorithms
Blowups, slicings and permutation groups in combinatorial topology