Pages that link to "Item:Q2449067"
From MaRDI portal
The following pages link to Counting rotation symmetric functions using Polya's theorem (Q2449067):
Displaying 8 items.
- Affine equivalence of monomial rotation symmetric Boolean functions: a Pólya's theorem approach (Q350512) (← links)
- Results on permutation symmetric Boolean functions (Q394462) (← links)
- On the number of rotation symmetric functions over \(\mathrm{GF}(p)\) (Q445387) (← links)
- Counting with symmetric functions (Q495643) (← links)
- Counting permutation equivalent degree six binary polynomials invariant under the cyclic group (Q2397156) (← links)
- Results on rotation symmetric polynomials over \(GF(p)\) (Q2465983) (← links)
- Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions (Q2515558) (← links)
- Construction and enumeration of balanced rotation symmetric Boolean functions (Q6611020) (← links)