Lower bounds for the complexity of polynomials (Q1822977): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(89)90094-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2142928190
@@ Property / OpenAlex ID: W2142928190 / rank @@
+Normal rank
@@ Property / cites work @@
+On polynomials with symmetric Galois group which are easy to compute
+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 @@
+On the additive complexity of polynomials
@@ Property / cites work: On the additive complexity of polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+On the representation of rational functions of bounded complexity
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1822977