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

Computing multivariate polynomials in parallel

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

DOI10.1016/0020-0190(80)90033-2zbMath0489.68036OpenAlexW2077425565MaRDI QIDQ1166928

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)


Related Items (4)

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



Cites Work

  • Fast Parallel Matrix Inversion Algorithms
  • On the Parallel Evaluation of Multivariate Polynomials
  • Unnamed Item
  • Unnamed Item


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

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