Quotient structures and groups computable in polynomial time

DOI10.1007/978-3-031-09574-0_3MaRDI QIDQ2097210zbMATH OpenOpenAlexFDO

Authors P. E. Alaev

Publication date 11 November 2022

Full work available at URL https://doi.org/10.1007/978-3-031-09574-0_3

zbMATH Keywords

computable structuresgroupspolynomial computabilityprimitive recursive structures

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Algebraic structures computable without delay
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• Fields of algebraic numbers computable in polynomial time. I
• Fields of algebraic numbers computable in polynomial time. II
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1302879 (Why is no real title available?)
• Polynomial-time Abelian groups
• Polynomial-time versus recursive models
• Polynomially computable structures with finitely many generators
• Searching for applicable versions of computable structures
• Structures computable in polynomial time. I

Cited in

(5)

• scientific article; zbMATH DE number 4057755 (Why is no real title available?)
• scientific article; zbMATH DE number 2077108 (Why is no real title available?)
• A criterion for P-computability of structures
• Inversion operations in algebraic structures
• Description of structures computable in polynomial time

This page was built for publication: Quotient structures and groups computable in polynomial time

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