scientific article; zbMATH DE number 7407778
From MaRDI portal
Publication:5155667
Alexander G. Melnikov, Keng Meng Ng, Rodney G. Downey
Publication date: 8 October 2021
Full work available at URL: https://arxiv.org/abs/2007.07401
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
New degree spectra of Polish spaces, Rogers semilattices of punctual numberings, Primitive recursive equivalence relations and their primitive recursive complexity, Primitive recursive reverse mathematics, Punctually presented structures I: Closure theorems, COMPUTABLY COMPACT METRIC SPACES, Punctual definability on structures, Computable embeddability for algebraic structures, Searching for applicable versions of computable structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inductive inference and reverse mathematics
- Fundamentals of parameterized complexity
- Inverting the Furstenberg correspondence
- Diagonally non-computable functions and fireworks
- Algebraic structures computable without delay
- Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
- Online promise problems with online width metrics
- A c.e. real that cannot be sw-computed by any \(\Omega\) number
- Topological properties of concept spaces (full version)
- Space complexity of abelian groups
- A primal-dual perspective of online learning algorithms
- Interval graphs and interval orders
- Theory of representations
- An on-line graph coloring algorithm with sublinear performance ratio
- On direct products of automaton decidable theories
- Computational complexity of real functions
- Polynomial-time versus recursive models
- On the complexity of online computations of real functions
- Polynomial-time Abelian groups
- Polynomial and abstract subrecursive classes
- Coloring inductive graphs on-line
- Complexity models for incremental computation
- Online algorithms: a survey
- The fractal nature of Riem/Diff. I.
- Computable structures and the hyperarithmetical hierarchy
- Extended admissibility.
- On the uniform computational content of the Baire category theorem
- Structures computable in polynomial time. II
- Polynomial-time presentations of algebraic number fields
- The diversity of categoricity without delay
- Coloring interval graphs with First-Fit
- Punctual definability on structures
- Graphs are not universal for online computability
- Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
- Probabilistic computability and choice
- Structures computable in polynomial time. I
- Parametrized complexity theory.
- Recursive analysis
- The primitive recursive analysis of ordinary differential equations and the complexity of their solutions
- Complexity Theory for Operators in Analysis
- Reverse Mathematics of Matroids
- Weihrauch degrees, omniscience principles and weak computability
- The additive group of the rationals does not have an automatic presentation
- Algorithmic Randomness and Complexity
- Computable functionals
- Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
- Graph minors. II. Algorithmic aspects of tree-width
- An Effective Version of Dilworth's Theorem
- Effective coloration
- On-Line Algorithms for Division and Multiplication
- Unreliable failure detectors for reliable distributed systems
- Some characterizations of functions computable in on-line arithmetic
- A quest for algorithmically random infinite structures
- Reducibility among Combinatorial Problems
- Fast online multiplication of real numbers
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Parameterized and Exact Computation
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- Parameterized Algorithms
- Language identification in the limit
- Computability Theory and Differential Geometry
- On the concept of a random sequence
- Nicht konstruktiv beweisbare Sätze der Analysis
