Polynomial-time algorithms for permutation groups

Abstract

A permutation group on n letters may always be represented by a small set of generators, even though its size may be exponential in n. We show that it is practical to use such a representation since many problems such as membership testing, equality testing, and inclusion testing are decidable in polynomial time. In addition, we demonstrate that the normal… (More)
DOI: 10.1109/SFCS.1980.34

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Statistics

0102030'80'83'87'91'95'99'03'07'11'15
Citations per Year

206 Citations

Semantic Scholar estimates that this publication has 206 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics