Near-Optimal Complexity Bounds for Fragments of the Skolem Problem

DOI10.4230/LIPICS.STACS.2020.37MaRDI QIDQ5874310zbMATH OpenOpenAlexFDO

Authors S. Akshay, Nikhil Balaji, Aniket Murhekar, Rohith Varma, Nikhil Vyas

Publication date 7 February 2023

Full work available at URL https://doi.org/10.4230/LIPIcs.STACS.2020.37

zbMATH Keywords

linear recurrencesNP-completenessSkolem problemweighted automata

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(4)

• On eventual non-negativity and positivity for the weighted sum of powers of matrices
• Identity testing for radical expressions
• Robust positivity problems for linear recurrence sequences: the frontiers of decidability for explicitly given neighbourhoods
• On large zeros of linear recurrence sequences

This page was built for publication: Near-Optimal Complexity Bounds for Fragments of the Skolem Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874310)