Near-Optimal Complexity Bounds for Fragments of the Skolem Problem. - S. Akshay 001; Nikhil Balaji; Aniket Murhekar; Rohith Varma; Nikhil Vyas 001 (STACS, 2020)