Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

The impact of complexity theory on algorithms for sparse polynomials

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

DOI10.1145/1088233.1088236zbMATH Open0358.68074OpenAlexW2079599253MaRDI QIDQ4131012FDOQ4131012


Authors: Kenneth L. Manders Edit this on Wikidata


Publication date: 1977

Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1088233.1088236





Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)







This page was built for publication: The impact of complexity theory on algorithms for sparse polynomials

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4131012&oldid=17924478"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 09:09. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki