113 citations · 260 across the 57 of their papers we have counts for
Showing 2013 · cs.CCShow all
2 papers · 2 filters
cs.CC2013
Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
Joel Ouaknine, James Worrell
We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS)…
cs.CC2013
On the Complexity of the Orbit Problem
Ventsislav Chonev, Joël Ouaknine, James Worrell
We consider higher-dimensional versions of Kannan and Lipton's Orbit Problem---determining whether a target vector space V may be reached from a starting point x under repeated app…