4 citations · 4 across the 2 of their papers we have counts for
3 papers
On Sampling Lower Bounds for Polynomials
Mohammad Mahdi Khodabandeh, Igor Shinkar
In this work, we continue the line of research on the complexity of distributions (Viola, Journal of Computing 2012), and study samplers defined by low degree polynomials. An -t…
On the Power of Interactive Proofs for Learning
Tom Gur, Mohammad Mahdi Jahanara, Mohammad Mahdi Khodabandeh +3
We continue the study of doubly-efficient proof systems for verifying agnostic PAC learning, for which we obtain the following results. - We construct an interactive protocol for l…
Matrix Multiplication Reductions
Ashish Gola, Igor Shinkar, Harsimran Singh
In this paper we study a worst case to average case reduction for the problem of matrix multiplication over finite fields. Suppose we have an efficient average case algorithm, that…