Automating Pólya theory: The computational complexity of the cycle index polynomial

DOI10.1006/inco.1993.1045zbMath0785.20004OpenAlexW2085717081MaRDI QIDQ1261292

Leslie Ann Goldberg

Publication date: 1 September 1993

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1993.1045

zbMATH Keywords

generatorsNP-hardnumber of cyclespolynomially solvablegroup of permutationsevaluation problemPólya's cycle index polynomial

Mathematics Subject Classification ID

Related Items (3)

Generation of Colourings and Distinguishing Colourings of Graphs ⋮ Hahn polynomials and the Burnside process ⋮ Equivalence classes of matchings and lattice-square designs

This page was built for publication: Automating Pólya theory: The computational complexity of the cycle index polynomial