Length of polynomials over finite groups

DOI10.1016/J.JCSS.2015.05.002MaRDI QIDQ494061zbMATH OpenOpenAlexFDO

Authors 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

Boolean functions (06E30) Finite simple groups and their classification (20D05) Finite nilpotent groups, (p)-groups (20D15)

Recommendations

• scientific article; zbMATH DE number 488084
• scientific article; zbMATH DE number 479558
• scientific article; zbMATH DE number 770727
• scientific article; zbMATH DE number 3967135
• Groups generated by iterations of polynomials over finite fields
• Groups of permutation polynomials over finite fields
• Polynomial sequences in groups
• Finitely generated groups of polynomial subgroup growth
• scientific article; zbMATH DE number 691475
• On the length and depth of finite groups

Cites work

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

Cited in

(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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494061)