Published in: LIPIcs, Volume 207, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
Sankeerth Rao Karingula and Shachar Lovett. Singularity of Random Integer Matrices with Large Entries. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 33:1-33:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{karingula_et_al:LIPIcs.APPROX/RANDOM.2021.33, author = {Karingula, Sankeerth Rao and Lovett, Shachar}, title = {{Singularity of Random Integer Matrices with Large Entries}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)}, pages = {33:1--33:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-207-5}, ISSN = {1868-8969}, year = {2021}, volume = {207}, editor = {Wootters, Mary and Sanit\`{a}, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.33}, URN = {urn:nbn:de:0030-drops-147260}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.33}, annote = {Keywords: Coding Theory, Random matrix theory, Singularity probability MDS codes, Error correction codes, Littlewood Offord, Fourier Analysis} }
Published in: LIPIcs, Volume 124, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019)
Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, and Sankeerth Rao. Torus Polynomials: An Algebraic Approach to ACC Lower Bounds. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 13:1-13:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{bhrushundi_et_al:LIPIcs.ITCS.2019.13, author = {Bhrushundi, Abhishek and Hosseini, Kaave and Lovett, Shachar and Rao, Sankeerth}, title = {{Torus Polynomials: An Algebraic Approach to ACC Lower Bounds}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {13:1--13:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.13}, URN = {urn:nbn:de:0030-drops-101066}, doi = {10.4230/LIPIcs.ITCS.2019.13}, annote = {Keywords: Circuit complexity, ACC, lower bounds, polynomials} }
Published in: LIPIcs, Volume 102, 33rd Computational Complexity Conference (CCC 2018)
Daniel Kane and Sankeerth Rao. A PRG for Boolean PTF of Degree 2 with Seed Length Subpolynomial in epsilon and Logarithmic in n. In 33rd Computational Complexity Conference (CCC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 102, pp. 2:1-2:24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{kane_et_al:LIPIcs.CCC.2018.2, author = {Kane, Daniel and Rao, Sankeerth}, title = {{A PRG for Boolean PTF of Degree 2 with Seed Length Subpolynomial in epsilon and Logarithmic in n}}, booktitle = {33rd Computational Complexity Conference (CCC 2018)}, pages = {2:1--2:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-069-9}, ISSN = {1868-8969}, year = {2018}, volume = {102}, editor = {Servedio, Rocco A.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.2}, URN = {urn:nbn:de:0030-drops-88861}, doi = {10.4230/LIPIcs.CCC.2018.2}, annote = {Keywords: Pseudorandomness, Polynomial Threshold Functions} }
Feedback for Dagstuhl Publishing