Simplified lower bounds for polynomials with algebraic coefficients

On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science

Cited References

Computer algebra handbook

Complexity Lower Bounds using Linear Algebra

Foundations and Trends® in Theoretical Computer Science

Quadratic lower bounds on matrix rigidity

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation