✦ LIBER ✦

Computing the composition factors of a permutation group in polynomial time

✍ Scribed by Eugene M. Luks

Book ID: 110564253
Publisher: Springer-Verlag
Year: 1987
Tongue: English
Weight: 681 KB
Volume: 7
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02579204

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing the Subgroups of a Permutation

Computing the Subgroups of a Permutation Group

✍ John J. Cannon; Bruce C. Cox; Derek F. Holt 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 279 KB

A new method for computing the conjugacy classes of subgroups of a finite group is described.

The arithmetic of polynomial maps over a

The arithmetic of polynomial maps over a group and the structure of certain permutational polynomial groups. I

✍ S. D. Scott 📂 Article 📅 1969 🏛 Springer Vienna 🌐 English ⚖ 736 KB

A permuted factors approach for the line

A permuted factors approach for the linearization of polynomial matrices

✍ S. Vologiannidis; E. N. Antoniou 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 279 KB

Computing the Cutwidth of Bipartite Perm

Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time

✍ Heggernes, Pinar; van 't Hof, Pim; Lokshtanov, Daniel; Nederlof, Jesper 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 283 KB

On the Representation of a Group of Fini

On the Representation of a Group of Finite Order as a Permutation Group, and on the Composition of Permutation Groups

✍ Burnside, W. 📂 Article 📅 1901 🏛 Oxford University Press 🌐 English ⚖ 257 KB

Computing the optimal IO sequences of a

Computing the optimal IO sequences of a protocol in polynomial time

✍ Wen-Huei Chen; Chuan Yi Tang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 453 KB