@inproceedings{Akshayetal:STACS:2020,
    Address = {Dagstuhl, Germany},
    Annote = {Keywords: Linear Recurrences, Skolem problem, NP-completeness, Weighted automata},
    Author = {Akshay, S. and Balaji, Nikhil and Murhekar, Aniket and Varma, Rohith and Vyas, Nikhil},
    BookTitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)},
    Editor = {Paul, Christophe and Bl{\"a}ser, Markus},
    File = {Near-Optimal Complexity Bounds for Fragments of the Skolem Problem - LIPIcs-STACS-2020-37 - a - h.pdf},
    ISBN = {978-3-95977-140-5},
    ISSN = {1868-8969},
    Pages = {37:1--37:18},
    Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
    Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
    Title = {{Near-Optimal Complexity Bounds for Fragments of the Skolem Problem}},
    URL = {https://drops.dagstuhl.de/opus/volltexte/2020/11898},
    Volume = {154},
    Year = {2020},
    bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2020/11898},
    bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.STACS.2020.37},
    date-added = {2020-05-20 19:01:05 +0200},
    date-modified = {2020-05-20 19:03:26 +0200},
    urn = {urn:nbn:de:0030-drops-118982},
    doi = {10.4230/LIPIcs.STACS.2020.37}
}

@inproceedings{Akshayetal:STACS:2020, Address = {Dagstuhl, Germany}, Annote = {Keywords: Linear Recurrences, Skolem problem, NP-completeness, Weighted automata}, Author = {Akshay, S. and Balaji, Nikhil and Murhekar, Aniket and Varma, Rohith and Vyas, Nikhil}, BookTitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, Editor = {Paul, Christophe and Bl{\"a}ser, Markus}, File = {Near-Optimal Complexity Bounds for Fragments of the Skolem Problem - LIPIcs-STACS-2020-37 - a - h.pdf}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, Pages = {37:1--37:18}, Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, Series = {Leibniz International Proceedings in Informatics (LIPIcs)}, Title = {{Near-Optimal Complexity Bounds for Fragments of the Skolem Problem}}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/11898}, Volume = {154}, Year = {2020}, bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2020/11898}, bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.STACS.2020.37}, date-added = {2020-05-20 19:01:05 +0200}, date-modified = {2020-05-20 19:03:26 +0200}, urn = {urn:nbn:de:0030-drops-118982}, doi = {10.4230/LIPIcs.STACS.2020.37} }