516 citations · 2.7k across the 47 of their papers we have counts for
5 papers · 1 filter
Schur Polynomials do not have small formulas if the Determinant doesn't!
Prasad Chaugule, Mrinal Kumar, Nutan Limaye +3
Schur Polynomials are families of symmetric polynomials that have been classically studied in Combinatorics and Algebra alike. They play a central role in the study of Symmetric fu…
On the Probabilistic Degrees of Symmetric Boolean functions
Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
The probabilistic degree of a Boolean function is defined to be the smallest such that there is a random polynomial of degree at m…
Decoding Downset codes over a finite grid
Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
In a recent paper, Kim and Kopparty (Theory of Computing, 2017) gave a deterministic algorithm for the unique decoding problem for polynomials of bounded total degree over a genera…
Verifying Multipartite Entangled GHZ States via Multiple Quantum Coherences
Ken X. Wei, Isaac Lauer, Srikanth Srinivasan +6
The ability to generate and verify multipartite entanglement is an important benchmark for near-term quantum devices devices. We develop a scalable entanglement metric based on mul…
Strongly Exponential Separation Between Monotone VP and Monotone VNP
Srikanth Srinivasan
We show that there is a sequence of explicit multilinear polynomials with non-negative coefficients that lies in monotone VNP su…