Computing normalizers of permutation groups efficiently using isomorphisms of association schemes

13 years 8 months ago

Download shingen.ccn.yamanashi.ac.jp

This note presents an algorithm to speed up the computation of normalizers of permutation groups. It is an application of computation of isomorphisms of association schemes. Categories and Subject Descriptors

Izumi Miyamoto

Real-time Traffic

Computation | ISSAC 2000 | Mathematics | Permutation Groups | Subject Descriptors |

claim paper

» Fastanova an efficient algorithm for genomewide association study

» COE A General Approach for Efficient GenomeWide TwoLocus Epistasis Test in Disease Associa...

» Physically Realistic Virtual Surgery Using the PointAssociated Finite Field PAFF Approach

» Towards energy efficient mobile communications

» Progressive ContentSensitive Data Retrieval in Sensor Networks

» Plan Selection Based on Query Clustering

» Accelerated probabilistic inference of RNA structure evolution

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	2000
Where	ISSAC
Authors	Izumi Miyamoto

Comments (0)

Sciweavers

Computing normalizers of permutation groups efficiently using isomorphisms of association schemes

Computation | ISSAC 2000 | Mathematics | Permutation Groups | Subject Descriptors |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers