Go to the corresponding LIPIcs Volume Portal 
Akshay, S. ; Balaji, Nikhil ; Murhekar, Aniket ; Varma, Rohith ; Vyas, Nikhil
pdfformat: 

@InProceedings{akshay_et_al:LIPIcs:2020:11898, author = {S. Akshay and Nikhil Balaji and Aniket Murhekar and Rohith Varma and Nikhil Vyas}, title = {{NearOptimal Complexity Bounds for Fragments of the Skolem Problem}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {37:137:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771405}, ISSN = {18688969}, year = {2020}, volume = {154}, editor = {Christophe Paul and Markus Bl{\"a}ser}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/11898}, URN = {urn:nbn:de:0030drops118982}, doi = {10.4230/LIPIcs.STACS.2020.37}, annote = {Keywords: Linear Recurrences, Skolem problem, NPcompleteness, Weighted automata} }
Keywords:  Linear Recurrences, Skolem problem, NPcompleteness, Weighted automata  
Collection:  37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)  
Issue Date:  2020  
Date of publication:  04.03.2020 