S. Kopparty

activity

20072026

most citedThe complexity of computing the minimum rank of a sign pattern matrix

12 citations · 27 across the 28 of their papers we have counts for

collaborators

Showing math.NTShow all

2 papers · 1 filter

math.NT2023

On the degree of polynomials computing square roots mod p

Kiran Kedlaya, Swastik Kopparty

For an odd prime $p$ , we say $f (X) \in F_{p} [X]$ computes square roots in $F_{p}$ if, for all nonzero perfect squares $a \in F_{p}$ , we have $f (a)^{2} = a$ . When…

math.NT2010★ 4 cited

Kakeya-type sets in finite vector spaces

Swastik Kopparty, Vsevolod F. Lev, Shubhangi Saraf +1

For a finite vector space $V$ and a non-negative integer $r \leq dim V$ we estimate the smallest possible size of a subset of $V$ , containing a translate of every $r$ -dimensional sub…