Published in: LIPIcs, Volume 264, 38th Computational Complexity Conference (CCC 2023)
Vinayak M. Kumar. Tight Correlation Bounds for Circuits Between AC0 and TC0. In 38th Computational Complexity Conference (CCC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 264, pp. 18:1-18:40, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{kumar:LIPIcs.CCC.2023.18, author = {Kumar, Vinayak M.}, title = {{Tight Correlation Bounds for Circuits Between AC0 and TC0}}, booktitle = {38th Computational Complexity Conference (CCC 2023)}, pages = {18:1--18:40}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-282-2}, ISSN = {1868-8969}, year = {2023}, volume = {264}, editor = {Ta-Shma, Amnon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.18}, URN = {urn:nbn:de:0030-drops-182885}, doi = {10.4230/LIPIcs.CCC.2023.18}, annote = {Keywords: AC⁰, TC⁰, Switching Lemma, Lower Bounds, Correlation Bounds, Circuit Complexity} }
Published in: LIPIcs, Volume 185, 12th Innovations in Theoretical Computer Science Conference (ITCS 2021)
Venkatesan Guruswami and Vinayak M. Kumar. Pseudobinomiality of the Sticky Random Walk. In 12th Innovations in Theoretical Computer Science Conference (ITCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 185, pp. 48:1-48:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{guruswami_et_al:LIPIcs.ITCS.2021.48, author = {Guruswami, Venkatesan and Kumar, Vinayak M.}, title = {{Pseudobinomiality of the Sticky Random Walk}}, booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)}, pages = {48:1--48:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-177-1}, ISSN = {1868-8969}, year = {2021}, volume = {185}, editor = {Lee, James R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.48}, URN = {urn:nbn:de:0030-drops-135870}, doi = {10.4230/LIPIcs.ITCS.2021.48}, annote = {Keywords: Expander Graphs, Fourier analysis, Markov Chains, Pseudorandomness, Random Walks} }
Feedback for Dagstuhl Publishing