Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Ghosal, Purnata"'
Publikováno v:
42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022), pp. 20:1--20:15
We analyze Kumar's recent quadratic algebraic branching program size lower bound proof method (CCC 2017) for the power sum polynomial. We present a refinement of this method that gives better bounds in some cases. The lower bound relies on Noether-Le
Externí odkaz:
http://arxiv.org/abs/2205.02149
Proving super polynomial size lower bounds for various classes of arithmetic circuits computing explicit polynomials is a very important and challenging task in algebraic complexity theory. We study representation of polynomials as sums of weaker mod
Externí odkaz:
http://arxiv.org/abs/2010.01385
Autor:
Ghosal, Purnata1 (AUTHOR) purnatag@gmail.com, Raghavendra Rao, B.V.1 (AUTHOR)
Publikováno v:
Fundamenta Informaticae. 2020, Vol. 177 Issue 1, p69-93. 25p.
Autor:
Ghosal, Purnata, Rao, B.V. Raghavendra
Publikováno v:
In Information Processing Letters November 2019 151