Concepedia

Chandan Saha

CS

Statistics

Publications

9

Citations

240

H-Index

9

Active since

2008

Affiliations

Indian Institute of Science Bangalore(Current)

Microsoft Research (India)

Microsoft (United States)

Indian Institute of Technology Kanpur

Indian Institute of Technology Bombay

Chandan Saha is an author at Indian Institute of Science Bangalore specializing in computational complexity, engineering, and discrete mathematics.

Top concepts

EngineeringComputational ComplexityDiscrete MathematicsCircuit ComplexityComputer ScienceAlgebraic ComplexityFormal MethodsTheory Of ComputingComputer EngineeringMathematical Foundations

Publications per year

2008–2016

9

Publications

9

A super-polynomial lower bound for regular arithmetic formulas

Neeraj Kayal, Chandan Saha, Ramprasad Saptharishi · 2014 · 56 citations

Circuit Complexity, Computational Complexity Theory, Engineering +17

Quasi-polynomial hitting-set for set-depth-Δ formulas

Manindra Agrawal, Chandan Saha, Nitin Saxena · 2013 · 38 citations

Theory Of Computing, Circuit Complexity, Depth-d Formula C +14

An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas

Neeraj Kayal, Nutan Limaye, Chandan Saha et al. · 2014 · 38 citations

Theory Of Computing, Homogeneous Depth Four, Geometry Of Number +14

Jacobian hits circuits

Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi et al. · 2012 · 37 citations

Circuit Complexity, Identity Testing, Single Common Tool +13

Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits

Neeraj Kayal, Vineet Nair, Chandan Saha · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2016 · 19 citations · Full text

Circuit Complexity, Mathematical Programming, Branch-and-bound Algorithm +13

1–5 of 9