Zobrazeno 1 - 10
of 22
pro vyhledávání: '"BHARGAVA, VISHWAS"'
Autor:
Bhargava, Vishwas, Tengse, Anamay
The dimension of partial derivatives (Nisan and Wigderson, 1997) is a popular measure for proving lower bounds in algebraic complexity. It is used to give strong lower bounds on the Waring decomposition of polynomials (called Waring rank). This natur
Externí odkaz:
http://arxiv.org/abs/2407.10143
Autor:
Bhargava, Vishwas1 (AUTHOR) vishwas1384@gmail.com, Ghosh, Sumanta2 (AUTHOR) besusumanta@gmail.com, Guo, Zeyu3 (AUTHOR) zguotcs@gmail.com, Kumar, Mrinal4 (AUTHOR) mrinalkumar08@gmail.com, Umans, Chris5 (AUTHOR) umans@cs.caltech.edu
Publikováno v:
Journal of the ACM. Jun2024, Vol. 71 Issue 3, p1-32. 32p.
Autor:
BHARGAVA, VISHWAS1 vishwas1384@gmail.com, GHOSH, SUMANTA2 besusumanta@gmail.com, KUMAR, MRINAL3 mrinalkumar08@gmail.com, MOHAPATRA, CHANDRA KANTA4 ckmiitb@gmail.com
Publikováno v:
Journal of the ACM. Dec2023, Vol. 70 Issue 6, p1-46. 46p.
Multivariate multipoint evaluation is the problem of evaluating a multivariate polynomial, given as a coefficient vector, simultaneously at multiple evaluation points. In this work, we show that there exists a deterministic algorithm for multivariate
Externí odkaz:
http://arxiv.org/abs/2205.00342
Multipoint evaluation is the computational task of evaluating a polynomial given as a list of coefficients at a given set of inputs. And while \emph{nearly linear time} algorithms have been known for the univariate instance of multipoint evaluation f
Externí odkaz:
http://arxiv.org/abs/2111.07572
We give new and efficient black-box reconstruction algorithms for some classes of depth-$3$ arithmetic circuits. As a consequence, we obtain the first efficient algorithm for computing the tensor rank and for finding the optimal tensor decomposition
Externí odkaz:
http://arxiv.org/abs/2105.01751
In this paper we study the problem of deterministic factorization of sparse polynomials. We show that if $f \in \mathbb{F}[x_{1},x_{2},\ldots ,x_{n}]$ is a polynomial with $s$ monomials, with individual degrees of its variables bounded by $d$, then $
Externí odkaz:
http://arxiv.org/abs/1808.06655
Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of characteristic $
Externí odkaz:
http://arxiv.org/abs/1702.00558
Autor:
BHARGAVA, VISHWAS1 vishwas1384@gmail.com, SARAF, SHUBHANGI1 shubhangi.saraf@gmail.com, VOLKOVICH, ILYA2 ilyavol@umich.edu
Publikováno v:
Journal of the ACM. Mar2020, Vol. 67 Issue 2, p1-28. 28p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.