- 最后登录
- 2014-4-11
- 在线时间
- 678 小时
- 阅读权限
- 90
- 注册时间
- 2009-6-23
- 积分
- 24444
- 帖子
- 678
- 精华
- 0
- UID
- 99999
- 性别
- 保密
- 积分
- 24444
- 帖子
- 678
- 精华
- 0
- UID
- 99999
- 性别
- 保密
|
Abstract: This note presents an elementary version of Sims’s algorithm for computing strong generators of a given perm group, together with a proof of correctness and some notes about appropriate low-level data structures. Upper and lower bounds on the running time are also obtained. (Following a suggestion of Vaughan Pratt, we adopt the convention that perm = permutation, perhaps thereby saving millions of syllables in future research.)
=======================================
只是一篇11页的paper。。。
标题直译就是。。。置换群[算法?]的有效实现。。。- -
=======================================
不翻译的理由主要是。。= = 貌似能看懂它的人都不存在语言障碍。。而且翻译会有各种语意问题,还不如不翻译。。。 |
|