Nearly linear time algorithms for permutation groups: An interplay between theory and practice

DOI10.1023/A:1005911125383zbMath0915.20001OpenAlexW1602534306MaRDI QIDQ1270640

Seress, Ákos

Publication date: 22 April 1999

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1005911125383

zbMATH Keywords

permutation groupsdeterministic algorithmsupper central seriescomputational group theorynearly linear time algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10)

Uses Software

• Unnamed Item
• Unnamed Item

This page was built for publication: Nearly linear time algorithms for permutation groups: An interplay between theory and practice