Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring.

The article focuses on Algebraic circuits that provide a way, alternate to Turing machines to study computation. Topics include examines the complexity classes which contain polynomial families instead of languages as it is a natural question whether an algebraic complexity class is closed under factors and this is also a useful and a very well-studied problem both from the point of view of practice and theory.