"Nearly Linear Time Algorithms for Permutation Groups with a Small Base."

László Babai et al. (1991)

> Home

Details and statistics

DOI: 10.1145/120694.120724

access: closed

type: Conference or Workshop Paper

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/issac/BabaiCFS91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/issac/BabaiCFS91
László Babai, Gene Cooperman, Larry Finkelstein, Ákos Seress:
Nearly Linear Time Algorithms for Permutation Groups with a Small Base. ISSAC 1991: 200-209

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.