Horváth, Gábor (2015) The complexity of the equivalence and equation solvability problems over meta-Abelian groups. J. Algebra, 433. pp. 208-230.
This is the latest version of this item.
|
Text
MetaAbel.pdf - Accepted Version Download (452kB) | Preview |
Abstract
We provide polynomial time algorithms for deciding equation solvability and identity checking over groups that are semidirect products of two finite Abelian groups. Our main method is to reduce these problems to the sigma equation solvability and sigma equivalence problems over modules for commutative unital rings.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA72 Algebra / algebra Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Depositing User: | Dr Gábor Horváth |
| Date Deposited: | 25 Sep 2015 11:20 |
| Last Modified: | 18 Oct 2015 23:15 |
| URI: | http://real.mtak.hu/id/eprint/28031 |
Available Versions of this Item
- The complexity of the equivalence and equation solvability problems over meta-Abelian groups. (deposited 25 Sep 2015 11:20) [Currently Displayed]
Actions (login required)
 |
Edit Item |
