On the complexity of robust eventual inequality testing for C-finite functions
type: Item
instance of: scholarly article
title: On the complexity of robust eventual inequality testing for C-finite functions
DOI: 10.1007/978-3-031-45286-4_8
author: Eike Neumann
publication date: 2024-10-23T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7930577
MaRDI profile type: Publication
cites work: On robustness for the Skolem and positivity problems
cites work: Algorithms in real algebraic geometry
cites work: On the positivity set of a linear recurrence sequence
cites work: The continuous Skolem-Pisot problem
cites work: Deux propriétés décidables des suites récurrentes linéaires
cites work: Handbook of Computability and Complexity in Analysis
cites work: Computability on subsets of metric spaces.
cites work: On Recurrent Reachability for Continuous Linear Dynamical Systems
cites work: Q4598241
cites work: Q4421931
cites work: When can we detect that a P-finite sequence is positive?
cites work: Complexity Theory for Operators in Analysis
cites work: Q4002474
cites work: Q5155677
cites work: Parametrised second-order complexity theory with applications to the study of interval computation
cites work: On the Positivity Problem for Simple Linear Recurrence Sequences,
cites work: Positivity Problems for Low-Order Linear Recurrence Sequences
cites work: Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
cites work: An efficient procedure deciding positivity for a class of holonomic functions
cites work: Spaces allowing Type‐2 Complexity Theory revisited
cites work: Q3671245
cites work: Q4485693
cites work: Computability in linear algebra
description: scientific article; zbMATH DE number 7930577