Solving a fixed number of equations over finite groups

DOI10.1007/S00012-020-00701-6MaRDI QIDQ2226983zbMATH OpenOpenAlexFDO

Authors Philipp Nuspl

Publication date 9 February 2021

Published in Algebra Universalis (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00012-020-00701-6

zbMATH Keywords

computational complexityequation solvabilitypolynomial equationssemidirect products

Mathematics Subject Classification ID

Solving polynomial systems; resultants (13P15) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Algebraic geometry over groups; equations over groups (20F70) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The complexity of solving equations over finite groups
• The complexity of the equation solvability and equivalence problems over finite groups
• Mathematical Foundations of Computer Science 2004
• scientific article; zbMATH DE number 1834675
• The complexity of the equation solvability problem over semipattern groups

Cites work

• Combinatorial Nullstellensatz
• scientific article; zbMATH DE number 1250549 (Why is no real title available?)
• scientific article; zbMATH DE number 1759404 (Why is no real title available?)
• scientific article; zbMATH DE number 2133330 (Why is no real title available?)
• Intermediate problems in modular circuits satisfiability
• Solving systems of equations in supernilpotent algebras
• THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
• The complexity of problems connected with two-element algebras
• The complexity of solving equations over finite groups
• The complexity of the equation solvability and equivalence problems over finite groups
• The complexity of the equation solvability problem over nilpotent groups
• The complexity of the equation solvability problem over semipattern groups
• The complexity of the equivalence and equation solvability problems over meta-abelian groups
• The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
• The complexity of the equivalence problem over finite rings.

Cited in

(10)

• The complexity of solving equations over finite groups
• The complexity of equivalence and isomorphism of systems of equations over finite groups
• THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
• Detecting fast solvability of equations via small powerful Galois groups
• THE SOLUTION OF SETS OF EQUATIONS IN GROUPS
• scientific article; zbMATH DE number 1834675 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2004
• Systems of equations over finitely generated solvable groups
• Equations in finite semigroups: Explicit enumeration and asymptotics of solution numbers
• Inapproximability results for equations over infinite groups

This page was built for publication: Solving a fixed number of equations over finite groups

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