Publication:2226983: Difference between revisions
Created automatically from import240129110113 |
(No difference)
|
Latest revision as of 04:36, 2 February 2024
DOI10.1007/S00012-020-00701-6zbMATH Open1498.20078OpenAlexW3119220626MaRDI QIDQ2226983FDOQ2226983
Publication date: 9 February 2021
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00012-020-00701-6
Analysis of algorithms and problem complexity (68Q25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Algebraic geometry over groups; equations over groups (20F70) Solving polynomial systems; resultants (13P15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial Nullstellensatz
- The complexity of solving equations over finite groups
- The complexity of problems connected with two-element algebras
- THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
- The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
- THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS
- The complexity of the equation solvability problem over semipattern 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 equivalence and equation solvability problems over meta-abelian groups
- Intermediate problems in modular circuits satisfiability
Cited In (4)
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)