Saha, Chandan

1. Learning sums of powers of low-degree polynomials in the non-degenerate case
   2020/04/15 by Garg, Ankit, Kayal, Neeraj, Saha, Chandan · 3 citations
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning (cs.LG)
2. Quasi-polynomial Hitting-set for Set-depth-Delta Formulas
   2012/09/11 by Manindra Agrawal, Chandan Saha, Agrawal, Manindra +3 · 1 citation
   Computer Science · Engineering · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Cryptography and Data Security #FOS: Computer and information sciences #Low-power high-performance VLSI design
3. NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
   2024/10/16 by Omkar Baraskar, Baraskar, Omkar, Agrim Dewan +4 · 1 citation
   Computer Science · #Advanced Database Systems and Queries #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Machine Learning and Algorithms #Software Testing and Debugging Techniques