Polynomially computable structures with finitely many generators
From MaRDI portal
Publication:2213937
DOI10.1007/s10469-020-09598-5zbMath1484.03079OpenAlexW3097707318MaRDI QIDQ2213937
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
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (5)
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 ⋮ Searching for applicable versions of computable structures
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Structures computable in polynomial time. I
- Ideal membership in polynomial rings over the integers
This page was built for publication: Polynomially computable structures with finitely many generators
