Computing normalizers of permutation groups efficiently using isomorphisms of association schemes

DOI10.1145/345542.345637zbMath1326.68362OpenAlexW2091498619MaRDI QIDQ3454768

Izumi Miyamoto

Publication date: 26 November 2015

Published in: Proceedings of the 2000 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/345542.345637

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (1)

Constructing transitive permutation groups.

This page was built for publication: Computing normalizers of permutation groups efficiently using isomorphisms of association schemes