I. V. Latkin

Available identifiers

Publication	Date of Publication	Type
On computations over ordered rings	2024-11-25	Paper
A correspondence between the time and space complexity	2023-11-02	Paper
The recognition complexity of decidable theories	2022-07-05	Paper
The complexity of the isolators of the lower central series in the computable nilpotent groups	2021-09-27	Paper
On the computability of the terms and quotient groups by them in the upper and lower central series of the computable groups	2021-09-27	Paper
The complexity of the first-order theory of pure equality	2019-07-10	Paper
On Constructive Nilpotent Groups	2017-04-04	Paper
The coincidence of the classes of problems solvable by deterministic algorithms bounded by exponential time and polynomial space	2015-10-09	Paper
Recognition complexity of theories and their computational expressivity	2012-12-11	Paper
https://portal.mardi4nfdi.de/entity/Q4795511	2003-02-24	Paper
https://portal.mardi4nfdi.de/entity/Q3148496	2002-10-06	Paper
The arithmetic hierarchy of torsion-free nilpotent groups	2001-07-24	Paper
The third commutant membership problem in solvable groups	1999-05-11	Paper
Algorithmic complexity of the problem of occurrence in commutants and members of the lower central series	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3778735	1987-01-01	Paper

This page was built for person: I. V. Latkin