%0 Conference Paper %1 conf/stacs/AkshayBMV020 %A Akshay, S. %A Balaji, Nikhil %A Murhekar, Aniket %A Varma, Rohith %A Vyas, Nikhil %B STACS %D 2020 %E Paul, Christophe %E Bläser, Markus %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 37:1-37:18 %T Near-Optimal Complexity Bounds for Fragments of the Skolem Problem. %U http://dblp.uni-trier.de/db/conf/stacs/stacs2020.html#AkshayBMV020 %V 154 %@ 978-3-95977-140-5

@inproceedings{conf/stacs/AkshayBMV020, added-at = {2022-10-02T00:00:00.000+0200}, author = {Akshay, S. and Balaji, Nikhil and Murhekar, Aniket and Varma, Rohith and Vyas, Nikhil}, biburl = {https://www.bibsonomy.org/bibtex/2fe7084cb4fcd1e8db701b9a51977e504/dblp}, booktitle = {STACS}, crossref = {conf/stacs/2020}, editor = {Paul, Christophe and Bläser, Markus}, ee = {https://doi.org/10.4230/LIPIcs.STACS.2020.37}, interhash = {ca25cbe152e32f9fbc1a28361b7e0cc4}, intrahash = {fe7084cb4fcd1e8db701b9a51977e504}, isbn = {978-3-95977-140-5}, keywords = {dblp}, pages = {37:1-37:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-08-26T07:21:20.000+0200}, title = {Near-Optimal Complexity Bounds for Fragments of the Skolem Problem.}, url = {http://dblp.uni-trier.de/db/conf/stacs/stacs2020.html#AkshayBMV020}, volume = 154, year = 2020 }