On the additive complexity of polynomials (Q1157163): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(80)90068-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2081103509
@@ Property / OpenAlex ID: W2081103509 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3280357
@@ Property / cites work: Q3280357 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Number of Additions to Compute Specific Polynomials
+Normal rank
@@ Property / cites work @@
+Q4190138
@@ Property / cites work: Q4190138 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for polynomials with algebraic coefficients
+Normal rank
@@ Property / cites work @@
+Evaluation of polynomials with super-preconditioning
+Normal rank
@@ Property / cites work @@
+On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Computation of Linear Forms
@@ Property / cites work: An Algorithm for the Computation of Linear Forms / rank @@
+Normal rank
@@ Property / cites work @@
+Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials
+Normal rank
@@ Property / cites work @@
+Polynomials with Rational Coefficients Which are Hard to Compute
+Normal rank
@@ Property / cites work @@
+On the number of multiplications necessary to compute certain functions
+Normal rank
@@ Property / Wikidata QID @@
+Q126352409
@@ Property / Wikidata QID: Q126352409 / rank @@
+Normal rank