Searching for applicable versions of computable structures

DOI10.1007/978-3-030-80049-9_1OpenAlexW3180573182MaRDI QIDQ2117745FDOQ2117745

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

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

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)