On robustness for the Skolem, positivity and ultimate positivity problems

DOI10.46298/lmcs-20(2:11)2024MaRDI QIDQ6563058

Blaise Genest, S. Akshay, Hugo Bazille, Mihir Vahanwala

Publication date: 27 June 2024

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

zbMATH Keywords

verificationrobustnessdynamical systemsSkolem problem

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Occurrence of zero in a linear recursive sequence
• On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
• Linear fractional transformations of continued fractions with bounded partial quotients
• The presence of a zero in an integer linear recurrent sequence is NP-hard to decide
• Neuer Beweis und Verallgemeinerung eines Hurwitzschen Satzes.
• Deux propriétés décidables des suites récurrentes linéaires
• Complexity of Restricted Variants of Skolem and Related Problems
• On the Positivity Problem for Simple Linear Recurrence Sequences,
• Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
• Computer Aided Verification
• Positivity Problems for Low-Order Linear Recurrence Sequences
• Approximate Verification of the Symbolic Dynamics of Markov Chains
• Termination of Integer Linear Programs
• Algorithms in real algebraic geometry
• On robustness for the Skolem and positivity problems
• The pseudo-reachability problem for diagonalisable linear dynamical systems

This page was built for publication: On robustness for the Skolem, positivity and ultimate positivity problems