85 citations · 294 across the 35 of their papers we have counts for
4 papers · 1 filter
An Improved Line-Point Low-Degree Test
Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi +1
We prove that the most natural low-degree test for polynomials over finite fields is ``robust'' in the high-error regime for linear-sized fields. Specifically we consider the ``loc…
Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes
Rohan Goyal, Prahladh Harsha, Mrinal Kumar +1
We show that the known list-decoding algorithms for univariate multiplicity and folded Reed-Solomon codes can be made to run in time. Univariate multiplicity codes a…
Fast Numerical Multivariate Multipoint Evaluation
Sumanta Ghosh, Prahladh Harsha, Simão Herdade +2
We design nearly-linear time numerical algorithms for the problem of multivariate multipoint evaluation over the fields of rational, real and complex numbers. We consider both \emp…
Criticality of formulae
Prahladh Harsha, Tulasi mohan Molli, Ashutosh Shankar
Rossman [In $\textit{Proc. $34$th Comput. Complexity Conf.}$, 2019] introduced the notion of . The criticality of a Boolean function $f : \{0,1\}^n \to \{0,1\…