Complexity lower bounds for approximation algebraic computation trees (Q1578509): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1970197763
@@ Property / OpenAlex ID: W1970197763 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity estimates depending on condition and round-off error
+Normal rank
@@ Property / cites work @@
+Q4348513
@@ Property / cites work: Q4348513 / rank @@
+Normal rank
@@ Property / cites work @@
+Nearly sharp complexity bounds for multiprocessor algebraic computations
+Normal rank
@@ Property / cites work @@
+Q4542540
@@ Property / cites work: Q4542540 / rank @@
+Normal rank
@@ Property / cites work @@
+An exponential lower bound on the size of algebraic decision trees for MAX
+Normal rank
@@ Property / cites work @@
+Q4231918
@@ Property / cites work: Q4231918 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for arithmetic networks
@@ Property / cites work: Lower bounds for arithmetic networks / rank @@
+Normal rank
@@ Property / cites work @@
+On the worst-case arithmetic complexity of approximating zeros of polynomials
+Normal rank
@@ Property / cites work @@
+On the topology of algorithms. I
@@ Property / cites work: On the topology of algorithms. I / rank @@
+Normal rank
@@ Property / cites work @@
+The Computational Complexity of Continued Fractions
+Normal rank
@@ Property / cites work @@
+Q4004217
@@ Property / cites work: Q4004217 / rank @@
+Normal rank