On lower bounds for the complexity of polynomials and their multiples
type: Item
instance of: scholarly article
title: On lower bounds for the complexity of polynomials and their multiples
zbMATH Open document ID: 0962.68074
author: Walter Baur
author: Karin Halupczok
published in: Computational Complexity
publication date: 2000-11-20T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1533076
zbMATH Keywords: algebraic complexity
zbMATH Keywords: lower bounds
MaRDI profile type: Publication
full work available at URL: s000370050001
OpenAlex ID: W1997195656
DOI: 10.1007/S000370050001
Recommended article: Lower bounds for the complexity of polynomials
Recommended article: Q4302461
Recommended article: On algebraic complexity of polynomials and their multiples
Recommended article: STACS 2005
Recommended article: A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields
Recommended article: On the complexity of the computation of certain classes of polynomials of several variables
Recommended article: Lower bounds of complexity for polarized polynomials over finite fields
Recommended article: Q3802603
Recommended article: Q4015003
Recommended article: Lower bounds for polynomials of many variables
description: scientific article; zbMATH DE number 1533076