Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

The actual complexity of parallel evaluation of low degree polynomials

From MaRDI portal
Publication:582800
Jump to:navigation, search

DOI10.1016/0167-8191(90)90120-XzbMath0691.65004MaRDI QIDQ582800

O. Michael Atogi, Razeyah R. Stephen, Ronald J. Leach

Publication date: 1990

Published in: Parallel Computing (Search for Journal in Brave)


zbMATH Keywords

computer graphicsparallel algorithmscomplexity theoryevaluation of polynomials


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computation of special functions and constants, construction of tables (65D20) Parallel numerical computation (65Y05)


Related Items (1)

Data-movement-intensive problems: Two folk theorems in parallel computation revisited







This page was built for publication: The actual complexity of parallel evaluation of low degree polynomials

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:582800&oldid=12476606"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 07:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki