# Permutation Groups and Polynomial Time Computation ePub download

## by E. Luks

**Author:**E. Luks**ISBN:**0691043310**ISBN13:**978-0691043319**ePub:**1918 kb |**FB2:**1371 kb**Language:**English**Category:**Mathematics**Publisher:**Princeton University Press (February 22, 2022)**Rating:**4.1/5**Votes:**231**Format:**doc docx rtf txt

PDF On Sep 1, 1993, Eugene M. Luks and others published Permutation groups and polynomial-time computation. All content in this area was uploaded by Eugene Luks on Mar 10, 2015.

PDF On Sep 1, 1993, Eugene M. In this section, we describe some of the group-theoretic definitions and background used in the paper. For more details see.

In mathematics, a permutation polynomial (for a given ring) is a polynomial that acts as a permutation of the elements of the ring, . the map. is a bijection. In case the ring is a finite field, the Dickson polynomials, which are closely related to the Chebyshev polynomials, provide examples. Over a finite field, every function, so in particular every permutation of the elements of that field, can be written as a polynomial function.

Semantic Scholar extracted view of "Permutation Groups and . oceedings{A, title {Permutation Groups and Polynomial-Time Computation}, author {Eugene M. Luks}, booktitle {Groups And Computation}, year {1991} }.

Semantic Scholar extracted view of "Permutation Groups and Polynomial-Time Computation" by Eugene M. Luks. Eugene M.

Polynomial-Time Algorithms for Permutation Groups. Merrick Furst l 2 John Hopcroft 3 Eugene Luks. ACM Symposium on the Theory of Computing (1980). Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time. shown to include the other? We provide posit1ve. answers to each of these questions in the form of polynomial-time algorithms. Classical algorithmS to solve these problems have been known to computational group theorists' for some time. but without accurate analyses of running times.

Polynomial-time al-gorithms for permutation groups. Permutation groups and polynomial-time computation

Polynomial-time al-gorithms for permutation groups. In 21st Annual Symposium on Foundations of Computer Science, Syracuse, New York, USA, 13-15 October 1980, pages 36–41. IEEE Computer Society, 1980. Permutation groups and polynomial-time computation.

Given generators for a group of permutations, it is shown that generators for the subgroups in a composition series can be found in polynomial time. The procedure also yields permutation representations of the composition factors. AMS subject classification (1980).

Permutation groups and polynomial-time computation,in Groups and Computation, DIMACS series in Discrete . Parallel computation in solvable permutation groups, Journal of Computer and System Sciences (Special Issue), 37 (1988), 39-62, (with P. McKenzie).

Permutation groups and polynomial-time computation,in Groups and Computation, DIMACS series in Discrete Mathematics and Theoretical Computer Science 11 (1993), 139-175. Computing composition series of primitive groups, in Groups and Computation, DIMACS series in Discrete Mathematics and Theoretical Computer Science 11 (1993), 1-15, (with L. Babai, Á Seress). Permutation groups in NC, Proc. on Theory of Computing, 1987, 409-420, (with L.

You can’t perform that action at this time. You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window.

Permutation groups and polynomial time computations.

3 Permutation Groups: A Complexity Overview . Polynomial-Time Algorithms . Nearly Linear-Time . Nearly Linear-Time Algorithms . Non-Polynomial-Time Methods. 48 48 51 52. v. vi Contents. Nowadays, permutation group algorithms are among the best developed parts of CGT, and we can handle groups of degree in the hundreds of thousands.