Fast parallel computation of polynomials using few processors

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

12 Citations (Scopus)

Abstract

It is shown that any multivariate polynomial that can be computed sequentially in C steps and has degree d can be computed in parallel in 0((log d) (log C + log d)) steps using only (Cd)0(1) processors.
Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 1981 : Proceedings, 10th Symposium Štrbské Pleso, Czechoslovakia August 31 – September 4, 1981
EditorsJozef Gruska, Michal Chytil
Number of pages8
PublisherSpringer
Publication date1981
Pages132-139
DOIs
Publication statusPublished - 1981
EventSymposium on Mathematical Foundations of Computer Science - Strbske Pleso, Czechoslovakia, Czech Republic
Duration: 31 Aug 19814 Sept 1981
Conference number: 10th

Conference

ConferenceSymposium on Mathematical Foundations of Computer Science
Number10th
Country/TerritoryCzech Republic
CityStrbske Pleso, Czechoslovakia
Period31/08/198104/09/1981
SeriesLecture Notes in Computer Science
Volume118

Fingerprint

Dive into the research topics of 'Fast parallel computation of polynomials using few processors'. Together they form a unique fingerprint.

Cite this