Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree

Vishwas Bhargava
Vishwas Bhargava

JOURNAL OF THE ACM, pp. 1-28, 2020.

Cited by: 1|Views21


In this article, we study the problem of deterministic factorization of sparse polynomials. We show that if f is an element of F[x(1), x(2),..., x(n)] is a polynomial with s monomials, with individual degrees of its variables bounded by d, then f can be deterministically factored in time s(poly(d) log n). Prior to our work, the only effic...More



Get fulltext within 24h
Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.


Upload a single paper

for 5 coins

Wechat's Red Packet

Upload 50 articles

for 280 coins

Wechat's Red Packet

Upload 200 articles

for 1200 coins

Wechat's Red Packet

Upload 500 articles

for 3000 coins

Wechat's Red Packet

Upload 1000 articles

for 7000 coins

Wechat's Red Packet
Your rating :