Ilya Volkovich

activity

20142025

most citedCharacterizing Arithmetic Read-Once Formulae

2 citations · 3 across the 5 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

math.AC2018

Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree

Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich

In this paper we study the problem of deterministic factorization of sparse polynomials. We show that if $f \in F [x_{1}, x_{2}, \dots, x_{n}]$ is a polynomial with $s$ mono…

cs.DS2018

One (more) line on the most Ancient Algorithm in History

Bruno Grenet, Ilya Volkovich

We give a new simple and short ("one-line") analysis for the runtime of the well-known Euclidean Algorithm. While very short simple, the obtained upper bound in near-optimal.