Author of the publication

Improved Approximate Degree Bounds for k-Distinctness.

, , and . TQC, volume 158 of LIPIcs, page 2:1-2:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Lower Bounds for the Approximate Degree of Block-Composed Functions.. ICALP, volume 55 of LIPIcs, page 17:1-17:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Determining Tournament Payout Structures for Daily Fantasy Sports., , and . ALENEX, page 172-184. SIAM, (2017)Dual Polynomials for Collision and Element Distinctness., and . Electron. Colloquium Comput. Complex., (2015)Vanishing-Error Approximate Degree and QMA Complexity., and . Electron. Colloquium Comput. Complex., (2019)Quantum Proofs of Proximity., , , and . CoRR, (2021)Distribution-independent Reliable Learning., and . COLT, volume 35 of JMLR Workshop and Conference Proceedings, page 3-24. JMLR.org, (2014)Reliably Learning the ReLU in Polynomial Time., , , and . COLT, volume 65 of Proceedings of Machine Learning Research, page 1004-1042. PMLR, (2017)Fiat-Shamir Security of FRI and Related SNARKs., , , , , and . ASIACRYPT (2), volume 14439 of Lecture Notes in Computer Science, page 3-40. Springer, (2023)Quantum Lower Bounds for Approximate Counting via Laurent Polynomials., , , and . CCC, volume 169 of LIPIcs, page 7:1-7:47. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches., , and . APPROX-RANDOM, volume 176 of LIPIcs, page 22:1-22:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)