Zobrazeno 1 - 7
of 7
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
Autor:
Rahul Santhanam, Daniil Musatov
This book constitutes the proceedings of the 16th International Computer Science Symposium in Russia, CSR 2021, held in Sochi, Russia, in June/July 2021. The 28 full papers were carefully reviewed and selected from 68 submissions. The papers cover a
This book constitutes the proceedings of the 25th International Conference on Computing and Combinatorics, COCOON 2019, held in Xi'an, China, in July 2019. The 55 papers presented in this volume were carefully reviewed and selected from 124 submissio
Autor:
Yixin Cao, Jianer Chen
This book constitutes the refereed proceedings of the 23rd International Conference on Computing and Combinatorics, COCOON 2017, held in Hiong Kong, China, in August 2017. The 56 full papers papers presented in this book were carefully reviewed and s