Short SLPs for sparse polynomial maps
From MaRDI portal
Cites work
- Computing Sequences with Addition Chains
- Constant depth formula and partial function versions of MCSP are hard
- Efficient evaluation of large polynomials
- Evaluation of Multivariate Polynomials and Their Derivatives
- Factoring sparse polynomials fast
- Greedy algorithms for optimizing multivariate Horner schemes
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- msolve. A library for solving polynomial systems
- On addition chains.
- On the Evaluation of Powers
- On the Evaluation of Powers and Monomials
- Remarks on number theory III. On addition chains
- The minimum number of edges in graphs with prescribed paths
- Towards a library for straight-line programs
This page was built for publication: Short SLPs for sparse polynomial maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7446188)