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

Improving multivariate Horner schemes with Monte Carlo tree search

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

DOI10.1016/j.cpc.2013.05.008zbMath1349.65017arXiv1207.7079OpenAlexW2148162538MaRDI QIDQ340058

Mohammad Hasan, M. Dambrine

Publication date: 11 November 2016

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.7079

zbMATH Keywords

computational techniques


Mathematics Subject Classification ID

Monte Carlo methods (65C05)


Related Items

Learning a performance metric of Buchberger's algorithm, Potential of FORM 4.0


Uses Software

  • FORM
  • haggies


Cites Work

  • Unnamed Item
  • Unnamed Item
  • Code optimization in FORM
  • Optimising code generation with haggies
  • EFFICIENT EVALUATION OF POLYNOMIALS AND THEIR PARTIAL DERIVATIVES IN HOMOTOPY CONTINUATION METHODS
  • Generation of optimal code for expressions via factorization
  • Greedy algorithms for optimizing multivariate Horner schemes
  • Efficient Evaluation of Large Polynomials
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:340058&oldid=12213572"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 03:37.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki