受强制性开放获取政策约束的文章 - Chandan Saha了解详情
可在其他位置公开访问的文章：7 篇
An exponential lower bound for homogeneous depth four arithmetic formulas
N Kayal, N Limaye, C Saha, S Srinivasan
SIAM Journal on Computing 46 (1), 307-335, 2017
强制性开放获取政策： Department of Science & Technology, India
Jacobian hits circuits: hitting-sets, lower bounds for depth-d occur-k formulas & depth-3 transcendence degree-k circuits
M Agrawal, C Saha, R Saptharishi, N Saxena
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
强制性开放获取政策： Department of Science & Technology, India
Quasi-polynomial hitting-set for set-depth-Δ formulas
M Agrawal, C Saha, N Saxena
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
强制性开放获取政策： German Research Foundation
Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization
P Amireddy, A Garg, N Kayal, C Saha, B Thankey
50th International Colloquium on Automata, Languages, and Programming (ICALP …, 2023
强制性开放获取政策： US National Science Foundation, Department of Science & Technology, India
Learning generalized depth three arithmetic circuits in the non-degenerate case
V Bhargava, A Garg, N Kayal, C Saha
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2022
强制性开放获取政策： US National Science Foundation
Equivalence test for read-once arithmetic formulas
N Gupta, C Saha, B Thankey
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
强制性开放获取政策： Department of Science & Technology, India
Testing equivalence to design polynomials
O Baraskar, A Dewan, C Saha
41st International Symposium on Theoretical Aspects of Computer Science …, 2024
强制性开放获取政策： Department of Science & Technology, India
出版信息和资助信息由计算机程序自动确定