Length of polynomials over finite groups

DOI10.1016/j.jcss.2015.05.002zbMath1328.68063OpenAlexW2142546549MaRDI QIDQ494061

Gábor Horváth, Chrystopher L. Nehaniv

Publication date: 31 August 2015

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2015.05.002

zbMATH Keywords

nilpotent groupsbranching programlength of polynomial functionspermutation branching programsimple non-abelian groups

Mathematics Subject Classification ID

Related Items (3)

Symmetric random function generator (SRFG): a novel cryptographic primitive for designing fast and robust algorithms ⋮ Word maps with constants on symmetric groups ⋮ Complexity of term representations of finitary functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Short polynomial representations for square roots modulo \(p\)
• Products of conjugacy classes in groups
• Polynomial functions on subdirect products
• The arithmetic of polynomial maps over a group and the structure of certain permutational polynomial groups. I
• Branching Programs for Tree Evaluation
• FINITE AXIOMATIZATION OF FINITE SOLUBLE GROUPS
• A Property of Finite Simple Non-Abelian Groups
• A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3
• Fundamentals of Computation Theory
• Varieties of groups
• Nonsolvable finite groups all of whose local subgroups are solvable
• Realizing complex boolean functions with simple groups
• Diameters of finite simple groups: sharp bounds and applications

This page was built for publication: Length of polynomials over finite groups