Searching for applicable versions of computable structures

DOI10.1007/978-3-030-80049-9_1MaRDI QIDQ2117745zbMATH OpenOpenAlexFDO

Authors P. E. Alaev, Victor Selivanov

Publication date 22 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-80049-9_1

zbMATH Keywords

structurecomputable presentationpolynomial-time presentationGrzegorczyk's presentationquotient-structure

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3868613 (Why is no real title available?)
• scientific article; zbMATH DE number 3936519 (Why is no real title available?)
• scientific article; zbMATH DE number 42630 (Why is no real title available?)
• scientific article; zbMATH DE number 1302879 (Why is no real title available?)
• scientific article; zbMATH DE number 1390542 (Why is no real title available?)
• scientific article; zbMATH DE number 1446863 (Why is no real title available?)
• scientific article; zbMATH DE number 7407778 (Why is no real title available?)
• Algebraic structures computable without delay
• Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (extended abstract)
• Computable structures and the hyperarithmetical hierarchy
• Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs
• Equivalence Relations, Invariants, and Normal Forms
• Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
• Existence and uniqueness of structures computable in polynomial time
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• Fields of algebraic numbers computable in polynomial time. I
• Hierarchies of Computable groups and the word problem
• Online Algorithms
• Polynomial algorithms in computer algebra
• Polynomial-time versus recursive models
• Polynomially computable structures with finitely many generators
• Sailing routes in the world of computation. 14th conference on computability in Europe, CiE 2018, Kiel, Germany, July 30 -- August 3, 2018. Proceedings
• Some complexity results for polynomial ideals
• Structures computable in polynomial time. I
• The shrinking property for NP and coNP
• The word and geodesic problems in free solvable groups.
• Three lectures on automatic structures

Cited in

(5)

• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• Inversion operations in algebraic structures
• Punctually presented structures I: Closure theorems
• The complexity of inversion in groups
• Quotient structures and groups computable in polynomial time

This page was built for publication: Searching for applicable versions of computable structures

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