Finitely generated structures computable in polynomial time

DOI10.1134/S0037446622050019OpenAlexW4300594599MaRDI QIDQ2088618

P. E. Alaev

Publication date: 6 October 2022

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0037446622050019

zbMATH Keywords

ringsemigroupgroupcomputable structurefieldalgorithm complexitypolynomial computability

Mathematics Subject Classification ID

Computational aspects and applications of commutative rings (13Pxx) Computability and recursion theory (03Dxx) Model theory (03Cxx)

Related Items (3)

A criterion for P-computability of structures ⋮ Punctually presented structures I: Closure theorems ⋮ The complexity of inversion in groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic structures computable without delay
• Fields of algebraic numbers computable in polynomial time. I
• Polynomial-time versus recursive models
• Some algorithmic problems for solvable groups
• Some complexity results for polynomial ideals
• Categoricity for primitive recursive and polynomial Boolean algebras
• Structures computable in polynomial time. I
• Ideal membership in polynomial rings over the integers
• CONSTRUCTIVE ALGEBRAS I

This page was built for publication: Finitely generated structures computable in polynomial time