516 citations · 2.7k across the 47 of their papers we have counts for
55 papers
Low-Degree Testing Over Grids
Prashanth Amireddy, Srikanth Srinivasan, Madhu Sudan
We study the question of local testability of low (constant) degree functions from a product domain to a field , where ${S_i} \subseteq…
Towards Optimal Depth-Reductions for Algebraic Formulas
Hervé Fournier, Nutan Limaye, Guillaume Malod +2
Classical results of Brent, Kuck and Maruyama (IEEE Trans. Computers 1973) and Brent (JACM 1974) show that any algebraic formula of size s can be converted to one of depth O(log s)…
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes
Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi +1
We study the following natural question on random sets of points in : Given a random set of points , what i…
A Robust Version of Hegedűs's Lemma, with Applications
Srikanth Srinivasan
Hegedűs's lemma is the following combinatorial statement regarding polynomials over finite fields. Over a field of characteristic and for a power of , t…
Direct calculation of the ZZ-interaction rates in the multi-mode circuit-QED
Firat Solgun, Srikanth Srinivasan
Hamiltonians of the superconducting qubits of Transmon type involve non-zero ZZ-interaction terms due to their finite and small anharmonicities. These terms might lead to the unwan…
On Vanishing Properties of Polynomials on Symmetric Sets of the Boolean Cube, in Positive Characteristic
Srikanth Srinivasan, S. Venkitesh
The finite-degree Zariski (Z-) closure is a classical algebraic object, that has found a key place in several applications of the polynomial method in combinatorics. In this work,…