33 citations · 74 across the 23 of their papers we have counts for
4 papers · 1 filter
Identity Testing and Lower Bounds for Read- Oblivious Algebraic Branching Programs
Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi +2
Read- oblivious algebraic branching programs are a natural generalization of the well-studied model of read-once oblivious algebraic branching program (ROABPs). In this work, we…
An exponential lower bound for homogeneous depth-5 circuits over finite fields
Mrinal Kumar, Ramprasad Saptharishi
In this paper, we show exponential lower bounds for the class of homogeneous depth- circuits over all small finite fields. More formally, we show that there is an explicit famil…
On Fortification of Projection Games
Amey Bhangale, Ramprasad Saptharishi, Girish Varma +1
A recent result of Moshkovitz \cite{Moshkovitz14} presented an ingenious method to provide a completely elementary proof of the Parallel Repetition Theorem for certain projection g…
Efficiently decoding Reed-Muller codes from random errors
Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk
Reed-Muller codes encode an -variate polynomial of degree by evaluating it on all points in . We denote this code by . The minimal distance of …