Q5155667 (Q5155667): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structures computable in polynomial time. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structures computable in polynomial time. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time presentations of algebraic number fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverting the Furstenberg correspondence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A c.e. real that cannot be sw-computed by any \(\Omega\) number / rank
 
Normal rank
Property / cites work
 
Property / cites work: FOUNDATIONS OF ONLINE STRUCTURE THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective coloration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagonally non-computable functions and fireworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weihrauch degrees, omniscience principles and weak computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic computability and choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the uniform computational content of the Baire category theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological properties of concept spaces (full version) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the concept of a random sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space complexity of abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time versus recursive models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time Abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unreliable failure detectors for reliable distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The primitive recursive analysis of ordinary differential equations and the complexity of their solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs are not universal for online computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online promise problems with online width metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4956005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval graphs and interval orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of real functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every recursive linear ordering has a copy in DTIME-SPACE(<i>n</i>,log(<i>n</i>)) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptive Complexity, Canonisation, and Definable Graph Structure Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse Mathematics of Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On direct products of automaton decidable theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive inference and reverse mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring inductive graphs on-line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Punctual definability on structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diversity of categoricity without delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic structures computable without delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Theory for Operators in Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quest for algorithmically random infinite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Version of Dilworth's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3950561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring interval graphs with First-Fit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line graph coloring algorithm with sublinear performance ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial and abstract subrecursive classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4749832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity models for incremental computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some characterizations of functions computable in on-line arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fractal nature of Riem/Diff. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3611832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended admissibility. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast online multiplication of real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual perspective of online learning algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability Theory and Differential Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nicht konstruktiv beweisbare Sätze der Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3260574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Algorithms for Division and Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: The additive group of the rationals does not have an automatic presentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of online computations of real functions / rank
 
Normal rank

Latest revision as of 18:46, 26 July 2024

scientific article; zbMATH DE number 7407778
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7407778

    Statements

    0 references
    0 references
    0 references
    8 October 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers