Online presentations of finitely generated structures
From MaRDI portal
Publication:2205949
DOI10.1016/j.tcs.2020.08.021zbMath1464.68443OpenAlexW3080769200MaRDI QIDQ2205949
Alexander G. Melnikov, Keng Meng Ng, Nikolay Bazhenov, Iskander Sh. Kalimullin
Publication date: 21 October 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.08.021
Recursive functions and relations, subrecursive hierarchies (03D20) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28) Online algorithms; streaming algorithms (68W27)
Related Items
Primitive recursive equivalence relations and their primitive recursive complexity ⋮ Punctually presented structures I: Closure theorems ⋮ Punctual dimension of algebraic structures in certain classes ⋮ Non-density in punctual computability ⋮ Punctual categoricity spectra of computably categorical structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic structures computable without delay
- Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
- Elementary theory of a finitely generated commutative ring
- An on-line graph coloring algorithm with sublinear performance ratio
- Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
- Polynomial-time versus recursive models
- On-line coloring \(k\)-colorable graphs
- Computable structures and the hyperarithmetical hierarchy
- Combinatorial group theory.
- Structures computable in polynomial time. II
- The diversity of categoricity without delay
- Categoricity for primitive recursive and polynomial Boolean algebras
- Primitively recursively categorical linear orderings
- Eliminating unbounded search in computable algebra
- Graphs are not universal for online computability
- The back-and-forth method and computability without delay
- Structures computable in polynomial time. I
- Subrings of finite index in finitely generated rings
- A note on finite ring extensions
- GOLOD–SHAFAREVICH GROUPS: A SURVEY
- Three Lectures on Automatic Structures
- Subgroups of finitely presented groups
- An Effective Version of Dilworth's Theorem
- On-Line Coloring and Recursive Graph Theory
- The Logical Complexity of Finitely Generated Commutative Rings
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Computable Algebra, General Theory and Theory of Computable Fields
This page was built for publication: Online presentations of finitely generated structures
