1 citations · 1 across the 2 of their papers we have counts for
4 papers
The Diophantine problem in finitely generated commutative rings
Albert Garreta, Alexei Miasnikov, Denis Ovchinnikov
We study systems of polynomial equations in infinite finitely generated commutative associative rings with an identity element. For each such ring we obtain an interpretation b…
Metabelian groups: full-rank presentations, randomness and Diophantine problems
Albert Garreta, Leire Legarreta, Alexei Miasnikov +1
We study metabelian groups given by full rank finite presentations in the variety of metabelian groups. We prove that …
Diophantine problems in solvable groups
Albert Garreta, Alexei Miasnikov, Denis Ovchinnikov
We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free s…
Low-complexity computations for nilpotent subgroup problems
Jeremy Macdonald, Alexei Miasnikov, Denis Ovchinnikov
We solve the following algorithmic problems using TC0 circuits, or in logspace and quasilinear time, uniformly in the class of nilpotent groups with bounded nilpotency class and ra…