Local List-Decoding and Testing of Random Linear Codes from High Error von Kopparty, Swastik, Saraf, Shubhangi

Volltext

IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM von DVIR, ZEEV, SARAF, SHUBHANGI, WIGDERSON, AVI

Volltext

On the Power of Homogeneous Depth 4 Arithmetic Circuits von Kumar, Mrinal, Saraf, Shubhangi

Volltext

Black-Box Identity Testing of Depth-4 Multilinear Circuits von Saraf, Shubhangi, Volkovich, Ilya

Volltext

High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity von Kopparty, Swastik, Meir, Or, Ron-Zewi, Noga, Saraf, Shubhangi

Volltext

High-rate codes with sublinear-time decoding von Kopparty, Swastik, Saraf, Shubhangi, Yekhanin, Sergey

Volltext

Incidence Bounds for Block Designs von Lund, Ben, Saraf, Shubhangi

Volltext

Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree von Bhargava, Vishwas, Saraf, Shubhangi, Volkovich, Ilya

Volltext

Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes von Kopparty, Swastik, Ron-Zewi, Noga, Saraf, Shubhangi, Wootters, Mary

Volltext

The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In von Kumar, Mrinal, Saraf, Shubhangi

Volltext

Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers von Dvir, Zeev, Kopparty, Swastik, Saraf, Shubhangi, Sudan, Madhu

Volltext

On List Recovery of High-Rate Tensor Codes von Kopparty, Swastik, Resch, Nicolas, Ron-Zewi, Noga, Saraf, Shubhangi, Silas, Shashwat

Volltext

Proximity Gaps for Reed–Solomon Codes von Ben-Sasson, Eli, Carmon, Dan, Ishai, Yuval, Kopparty, Swastik, Saraf, Shubhangi

Volltext

Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound von Gopi, Sivakanth, Kopparty, Swastik, Oliveira, Rafael, Ron-Zewi, Noga, Saraf, Shubhangi

Volltext

SYLVESTER–GALLAI TYPE THEOREMS FOR APPROXIMATE COLLINEARITY von AI, ALBERT, DVIR, ZEEV, SARAF, SHUBHANGI, WIGDERSON, AVI

Volltext

Finite Field Kakeya and Nikodym Sets in Three Dimensions von Lund, Ben, Saraf, Shubhangi, Wolf, Charles

Volltext

Acute and nonobtuse triangulations of polyhedral surfaces von Saraf, Shubhangi

Volltext

Equivalence of Polynomial Identity Testing and Polynomial Factorization von Kopparty, Swastik, Saraf, Shubhangi, Shpilka, Amir

Volltext

On the Number of Ordinary Lines Determined by Sets in Complex Space von Basit, Abdul, Dvir, Zeev, Saraf, Shubhangi, Wolf, Charles

Volltext

Tight lower bounds for linear 2-query LCCs over finite fields von Bhattacharyya, Arnab, Dvir, Zeev, Saraf, Shubhangi, Shpilka, Amir

Volltext