Near-Optimal Complexity Bounds for Fragments of the Skolem Problem
From MaRDI portal
Publication:5874310
DOI10.4230/LIPIcs.STACS.2020.37OpenAlexW3013335592MaRDI QIDQ5874310
Rohith Varma, Aniket Murhekar, Nikhil Vyas, S. Akshay, Nikhil Balaji
Publication date: 7 February 2023
Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2020.37
Related Items (2)
Decision Questions for Probabilistic Automata on Small Alphabets ⋮ On eventual non-negativity and positivity for the weighted sum of powers of matrices
This page was built for publication: Near-Optimal Complexity Bounds for Fragments of the Skolem Problem
