Cargando…

Permutation Group Algorithms /

Permutation group algorithms were instrumental in the proof of many deep results. This book describes the theory, up to the most recent developments, and includes hints for implementation and advanced exercises. It is recommended for everyone interested in using computers in group theory, and is sui...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Seress, kos
Autor Corporativo: Cambridge University Press
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cambridge : Cambridge University Press, 2003.
Colección:Cambridge tracts in mathematics ; no. 152.
Temas:
Acceso en línea:Texto completo

MARC

LEADER 00000cam a2200000Ma 4500
001 EBOOKCENTRAL_ocn668199608
003 OCoLC
005 20240329122006.0
006 m o d
007 cr |||||||||||
008 090508s2003 enk o 001 0 eng d
040 |a MNU  |b eng  |e pn  |c MNU  |d UIU  |d YDXCP  |d MERUC  |d EBLCP  |d OCLCO  |d OCLCQ  |d DEBSZ  |d OCLCQ  |d OCLCF  |d OCLCQ  |d LIP  |d ZCU  |d OCLCQ  |d HEBIS  |d OCLCO  |d U3W  |d OCLCA  |d STF  |d ICG  |d OCLCA  |d AU@  |d OCLCQ  |d TKN  |d DKC  |d OCLCQ  |d OL$  |d OCLCQ  |d OCLCO  |d OCLCQ  |d OCLCO  |d OCLCL 
019 |a 191035756  |a 843868221  |a 990483812 
020 |a 9780511546549  |q (ebook) 
020 |a 0511546548  |q (ebook) 
020 |a 0511068603 
020 |a 9780511068607 
029 1 |a AU@  |b 000055744146 
029 1 |a DEBBG  |b BV044079101 
029 1 |a DEBSZ  |b 379290936 
035 |a (OCoLC)668199608  |z (OCoLC)191035756  |z (OCoLC)843868221  |z (OCoLC)990483812 
050 4 |a QA 
082 0 4 |a 512/.2  |2 21 
049 |a UAMI 
100 1 |a Seress, kos. 
245 1 0 |a Permutation Group Algorithms /  |c kos Seress. 
260 |a Cambridge :  |b Cambridge University Press,  |c 2003. 
300 |a 1 online resource (274 pages) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a Cambridge Tracts in Mathematics ;  |v no. 152 
505 0 |a Cover; Half-title; Title; Copyright; Contents; 1 Introduction; 2 Black-Box Groups; 3 Permutation Groups A Complexity Overview; 4 Bases and Strong Generating Sets; 5 Further Low-Level Algorithms; 6 A Library of Nearly Linear-Time Algorithms; 7 Solvable Permutation Groups; 8 Strong Generating Tests; 9 Backtrack Methods; 10 Large-Base Groups; Bibliography; Index. 
520 |a Permutation group algorithms were instrumental in the proof of many deep results. This book describes the theory, up to the most recent developments, and includes hints for implementation and advanced exercises. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses. 
546 |a English. 
590 |a ProQuest Ebook Central  |b Ebook Central Academic Complete 
650 0 |a Permutation groups. 
650 0 |a Algorithms. 
650 2 |a Algorithms 
650 6 |a Groupes de permutations. 
650 6 |a Algorithmes. 
650 7 |a algorithms.  |2 aat 
650 7 |a Algorithms  |2 fast 
650 7 |a Permutation groups  |2 fast 
650 7 |a Permutationsgruppe  |2 gnd 
650 7 |a Computeralgebra  |2 gnd 
710 2 |a Cambridge University Press. 
730 0 |a Cambridge books online. 
758 |i has work:  |a Permutation group algorithms (Text)  |1 https://id.oclc.org/worldcat/entity/E39PCFxGhFbt6JGJ9kT9QwdKQy  |4 https://id.oclc.org/worldcat/ontology/hasWork 
776 0 8 |i Print version:  |z 9780521661034 
830 0 |a Cambridge tracts in mathematics ;  |v no. 152. 
856 4 0 |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=217726  |z Texto completo 
938 |a EBL - Ebook Library  |b EBLB  |n EBL217726 
938 |a YBP Library Services  |b YANK  |n 2825959 
994 |a 92  |b IZTAP