Length of polynomials over finite groups

DOI10.1016/J.JCSS.2015.05.002zbMATH Open1328.68063OpenAlexW2142546549MaRDI QIDQ494061FDOQ494061

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

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

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)

Cites Work

• Title not available (Why is that?)
• Varieties of groups
• Nonsolvable finite groups all of whose local subgroups are solvable
• Title not available (Why is that?)
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Title not available (Why is that?)
• FINITE AXIOMATIZATION OF FINITE SOLUBLE GROUPS
• Products of conjugacy classes in groups
• Diameters of finite simple groups: sharp bounds and applications
• Title not available (Why is that?)
• Short polynomial representations for square roots modulo \(p\)
• Polynomial functions on subdirect products
• The arithmetic of polynomial maps over a group and the structure of certain permutational polynomial groups. I
• Title not available (Why is that?)
• Branching Programs for Tree Evaluation
• 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
• Title not available (Why is that?)
• Realizing complex boolean functions with simple groups

Cited In (3)

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

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)