Pages that link to "Item:Q494061"
From MaRDI portal
The following pages link to Length of polynomials over finite groups (Q494061):
Displaying 4 items.
- Symmetric random function generator (SRFG): a novel cryptographic primitive for designing fast and robust algorithms (Q1694084) (← links)
- Complexity of term representations of finitary functions (Q4687485) (← links)
- Complexity analysis of Boolean functions via regular languages---some observations on M-programs over groups (Q4703655) (← links)
- Word maps with constants on symmetric groups (Q6143807) (← links)