On lower bounds for the complexity of polynomials and their multiples

DOI10.1007/S000370050001zbMath0962.68074OpenAlexW1997195656MaRDI QIDQ1587343

Karin Halupczok, Walter Baur

Publication date: 20 November 2000

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

Full work available at URL: https://doi.org/10.1007/s000370050001

zbMATH Keywords

lower boundsalgebraic complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Lower bounds for some decision problems over \(C\)

This page was built for publication: On lower bounds for the complexity of polynomials and their multiples