Pages that link to "Item:Q1261292"
From MaRDI portal
The following pages link to Automating Pólya theory: The computational complexity of the cycle index polynomial (Q1261292):
Displaying 5 items.
- Automatic proofs for formulae enumerating proper polycubes (Q322211) (← links)
- Equivalence classes of matchings and lattice-square designs (Q1765511) (← links)
- Generation of Colourings and Distinguishing Colourings of Graphs (Q3449807) (← links)
- (Q4841308) (← links)
- Hahn polynomials and the Burnside process (Q6098229) (← links)