Quotient structures and groups computable in polynomial time
From MaRDI portal
Publication:2097210
DOI10.1007/978-3-031-09574-0_3OpenAlexW4285261414MaRDI QIDQ2097210
Publication date: 11 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-09574-0_3
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Algebraic structures computable without delay
- Fields of algebraic numbers computable in polynomial time. I
- Polynomial-time versus recursive models
- Polynomial-time Abelian groups
- Searching for applicable versions of computable structures
- Fields of algebraic numbers computable in polynomial time. II
- Polynomially computable structures with finitely many generators
- Structures computable in polynomial time. I
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
This page was built for publication: Quotient structures and groups computable in polynomial time