scientific article; zbMATH DE number 7788988
From MaRDI portal
Publication:6137833
Cites work
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 3823893 (Why is no real title available?)
- scientific article; zbMATH DE number 3918486 (Why is no real title available?)
- scientific article; zbMATH DE number 1254237 (Why is no real title available?)
- scientific article; zbMATH DE number 1261815 (Why is no real title available?)
- scientific article; zbMATH DE number 1467843 (Why is no real title available?)
- scientific article; zbMATH DE number 1550519 (Why is no real title available?)
- scientific article; zbMATH DE number 783633 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- A note on recurring series
- A simple but exact and efficient algorithm for complex root isolation
- Algorithms in real algebraic geometry
- Almost periodic sequences.
- Automatic Sequences
- Deux propriétés décidables des suites récurrentes linéaires
- Multiplicative relations in number fields
- 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
- On the positivity set of a linear recurrence sequence
- Periods and the conjectures of Grothendieck and Kontsevich-Zagier
- Positivity problems for low-order linear recurrence sequences
- The presence of a zero in an integer linear recurrent sequence is NP-hard to decide
- Ultimate positivity is decidable for simple linear recurrence sequences
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6137833)
