Polynomial identity testing is a mathematical problem of determining whether two multivariate polynomials are identical. It involves an arithmetic circuit that computes a polynomial and decides if it is the zero polynomial. The computational complexity required for this problem is an open problem in algebraic computing complexity.
Carnegie Mellon University
Spring 2015
A foundational course that introduces formal languages, automata, computability, and complexity theories, including finite automata, Turing machines, and P/NP classes.
No concepts data
+ 35 more concepts