募捐 9月15日2024 – 10月1日2024 关于筹款

Permutation group algorithms

Permutation group algorithms

Seress A.
你有多喜欢这本书?
下载文件的质量如何?
下载该书,以评价其质量
下载文件的质量如何?
Permutation group algorithms are indispensable in the proofs of many deep results, including the construction and study of sporadic finite simple groups. This work describes the theory behind permutation group algorithms, up to the most recent developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. The book fills a significant gap in the symbolic computation literature for readers interested in using computers in group theory.
年:
2002
出版社:
CUP
语言:
english
页:
272
ISBN 10:
0511060165
ISBN 13:
9780511060168
系列:
Cambridge Tracts in Mathematics 152
文件:
DJVU, 3.27 MB
IPFS:
CID , CID Blake2b
english, 2002
线上阅读
正在转换
转换为 失败

关键词