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

@InProceedings{s_et_al:LIPIcs:2017:8130, author = {Akshay S. and Nikhil Balaji and Nikhil Vyas}, title = {{Complexity of Restricted Variants of Skolem and Related Problems}}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)}, pages = {78:178:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770460}, ISSN = {18688969}, year = {2017}, volume = {83}, editor = {Kim G. Larsen and Hans L. Bodlaender and JeanFrancois Raskin}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8130}, URN = {urn:nbn:de:0030drops81306}, doi = {10.4230/LIPIcs.MFCS.2017.78}, annote = {Keywords: Linear recurrence sequences, Skolem problem, NPcompleteness, Program termination} }
Keywords:  Linear recurrence sequences, Skolem problem, NPcompleteness, Program termination  
Seminar:  42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)  
Issue Date:  2017  
Date of publication:  22.11.2017 