Fast parallel computation of polynomials using few processors

Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

11 Citationer (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.
OriginalsprogEngelsk
TitelMathematical Foundations of Computer Science 1981 : Proceedings, 10th Symposium Štrbské Pleso, Czechoslovakia August 31 – September 4, 1981
RedaktørerJozef Gruska, Michal Chytil
Antal sider8
ForlagSpringer
Publikationsdato1981
Sider132-139
DOI
StatusUdgivet - 1981
BegivenhedSymposium on Mathematical Foundations of Computer Science - Strbske Pleso, Czechoslovakia, Tjekkiet
Varighed: 31 aug. 19814 sep. 1981
Konferencens nummer: 10th

Konference

KonferenceSymposium on Mathematical Foundations of Computer Science
Nummer10th
Land/OmrådeTjekkiet
ByStrbske Pleso, Czechoslovakia
Periode31/08/198104/09/1981
NavnLecture Notes in Computer Science
Vol/bind118

Fingeraftryk

Dyk ned i forskningsemnerne om 'Fast parallel computation of polynomials using few processors'. Sammen danner de et unikt fingeraftryk.

Citationsformater