DescriptionPolynomial factoring and learning arithmetic circuits (a.k.a. circuit-reconstruction) are two fundamental problems in algebraic complexity. They are deeply connected to the questions of circuit lower bounds and polynomial identity testing (PIT). In this dissertation, we present various new results on learning and factoring of low-depth circuits, while emphasizing these connections.