Description of structures computable in polynomial time
- 16 July 2025
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 177 (1)
Abstract
No abstract availableFunding Information
- Russian Science Foundation
This publication has 11 references indexed in Scilit:
- The Complexity of Inversion in GroupsAlgebra and Logic, 2023
- A Criterion for P-Computability of StructuresAlgebra and Logic, 2022
- Fields of Algebraic Numbers Computable in Polynomial Time. IAlgebra and Logic, 2020
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURESThe Journal of Symbolic Logic, 2019
- Algebraic structures computable without delayTheoretical Computer Science, 2017
- Structures Computable in Polynomial Time. IAlgebra and Logic, 2017
- Independence in computable algebraJournal of Algebra, 2015
- Space complexity of Abelian groupsArchive for Mathematical Logic, 2008
- Polynomial-time abelian groupsAnnals of Pure and Applied Logic, 1992
- Polynomial-time versus recursive modelsAnnals of Pure and Applied Logic, 1991