4 citations · 6 across the 5 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2019
Derandomization from Algebraic Hardness
Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi +1
A hitting-set generator (HSG) is a polynomial map such that for all -variate polynomials of small enough circuit size and degree, if is…
cs.CC2019★ 4 cited
Closure of VP under taking factors: a short and simple proof
Chi-Ning Chou, Mrinal Kumar, Noam Solomon
In this note, we give a short, simple and almost completely self contained proof of a classical result of Kaltofen [Kal86, Kal87, Kal89] which shows that if an variate degree $…
cs.CC2018
Some Closure Results for Polynomial Factorization and Applications
Chi-Ning Chou, Mrinal Kumar, Noam Solomon
In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if ot…