@InProceedings{bisht_et_al:LIPIcs.FSTTCS.2022.10,
author = {Bisht, Pranav and Volkovich, Ilya},
title = {{On Solving Sparse Polynomial Factorization Related Problems}},
booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)},
pages = {10:1--10:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-261-7},
ISSN = {1868-8969},
year = {2022},
volume = {250},
editor = {Dawar, Anuj and Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.10},
URN = {urn:nbn:de:0030-drops-174023},
doi = {10.4230/LIPIcs.FSTTCS.2022.10},
annote = {Keywords: Sparse Polynomials, Identity Testing, Derandomization, Factor-Sparsity, Multivariate Polynomial Factorization}
}