Complexity measures and hierarchies for the evaluation of integers and polynomials
type: Item
instance of: scholarly article
title: Complexity measures and hierarchies for the evaluation of integers and polynomials
zbMATH Open document ID: 0365.68049
DOI: 10.1016/0304-3975(76)90051-7
author: Richard J. Lipton
author: David P. Dobkin
published in: Theoretical Computer Science
publication date: 1977-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 65G50
Mathematics Subject Classification ID: 65H05
zbMATH DE Number: 3569832
MaRDI profile type: Publication
full work available at URL: 0304-3975(76)90051-7
OpenAlex ID: W2056432814
cites work: On the Number of Additions to Compute Specific Polynomials
cites work: Remarks on number theory III. On addition chains
cites work: Q5585021
cites work: Q5646951
cites work: On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
cites work: An Algorithm for the Computation of Linear Forms
cites work: Polynomials with Rational Coefficients Which are Hard to Compute
description: scientific article; zbMATH DE number 3569832