Lower bounds for polynomial evaluation and interpolation problems
type: Item
instance of: scholarly article
title: Lower bounds for polynomial evaluation and interpolation problems
zbMATH Open document ID: 0895.68075
DOI: 10.1007/BF01270384
author: Victor Shoup
author: Roman Smolensky
published in: Computational Complexity
publication date: 1998-09-20T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 41A05
zbMATH DE Number: 1151783
zbMATH Keywords: polynomial evaluation
zbMATH Keywords: arithmetic circuits
MaRDI profile type: Publication
cites work: Q4091421
cites work: Q4190138
cites work: A note on matrix rigidity
cites work: Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
cites work: Q4047029
cites work: Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
description: scientific article; zbMATH DE number 1151783