Simplified lower bounds for polynomials with algebraic coefficients

DOI10.1006/JCOM.1997.0435zbMATH Open0872.68051OpenAlexW2060363924MaRDI QIDQ1361874FDOQ1361874

Walter Baur

Publication date: 28 July 1997

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1997.0435

zbMATH Keywords

nonscalar complexity of polynomials with algebraic coefficients

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Title not available (Why is that?)
• On the intrinsic complexity of elimination theory
• Some polynomials that are hard to compute
• Lower bounds for polynomials with algebraic coefficients
• Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials
• Polynomials with Rational Coefficients Which are Hard to Compute
• On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials

Cited In (3)

• A new method to obtain lower bounds for polynomial evaluation
• Lower bounds for a polynomial in terms of its coefficients
• Time-space tradeoffs in algebraic complexity theory

This page was built for publication: Simplified lower bounds for polynomials with algebraic coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361874)