Polynomially computable structures with finitely many generators

DOI10.1007/S10469-020-09598-5MaRDI QIDQ2213937zbMATH OpenOpenAlexFDO

Authors P. E. Alaev

Publication date 4 December 2020

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10469-020-09598-5

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1302879 (Why is no real title available?)
• Fields of algebraic numbers computable in polynomial time. I
• Ideal membership in polynomial rings over the integers
• Polynomial-time versus recursive models
• Some algorithmic problems for solvable groups
• Some complexity results for polynomial ideals
• Structures computable in polynomial time. I

Cited in

(6)

• Fields of algebraic numbers computable in polynomial time. II
• The complexity of inversion in groups
• Complexity issues for the iterated \(h\)-preorders
• Quotient structures and groups computable in polynomial time
• On the index set of punctually categorical finitely generated structures
• Searching for applicable versions of computable structures

This page was built for publication: Polynomially computable structures with finitely many generators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2213937)