scientific article; zbMATH DE number 475356
From MaRDI portal
Publication:4273602
Recommendations
Cited in
(19)- Solvable black-box group problems are low for PP
- The counting complexity of group-definable languages
- How fast can we compute orbits of groups?
- Computer algebra libraries for combinatorial structures
- Baby-step giant-step algorithms for the symmetric group
- An algorithm for constructing representations of finite groups.
- scientific article; zbMATH DE number 3869565 (Why is no real title available?)
- scientific article; zbMATH DE number 4057754 (Why is no real title available?)
- scientific article; zbMATH DE number 1187227 (Why is no real title available?)
- scientific article; zbMATH DE number 77937 (Why is no real title available?)
- scientific article; zbMATH DE number 96388 (Why is no real title available?)
- scientific article; zbMATH DE number 475361 (Why is no real title available?)
- scientific article; zbMATH DE number 2149412 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- A practical model for computation with matrix groups.
- scientific article; zbMATH DE number 874439 (Why is no real title available?)
- Certifying solutions to permutation group problems.
- Polynomial-time algorithms for black-box distributive expanded groups
- Computer proofs in group theory
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4273602)