Computing multivariate polynomials in parallel

DOI10.1016/0020-0190(80)90033-2MaRDI QIDQ1166928zbMATH OpenOpenAlexFDO

Authors Leslie G. Valiant

Publication date 1980

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(80)90033-2

zbMATH Keywords

parallel computationalgebraic complexityformula sizecomputation of multivariate polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• scientific article; zbMATH DE number 3461412 (Why is no real title available?)
• scientific article; zbMATH DE number 3628385 (Why is no real title available?)
• Fast Parallel Matrix Inversion Algorithms
• On the Parallel Evaluation of Multivariate Polynomials

Cited in

(4)

• Rounds versus time for the two person pebble game
• Upper bounds on the complexity of solving systems of linear equations
• A better heuristic for orthogonal graph drawings
• Explicit constructions of linear-sized superconcentrators

This page was built for publication: Computing multivariate polynomials in parallel

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