Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs (Q685715): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for the integer element distinctness problem
+Normal rank
@@ Property / cites work @@
+On the Betti Numbers of Real Varieties
@@ Property / cites work: On the Betti Numbers of Real Varieties / rank @@
+Normal rank
@@ Property / cites work @@
+How to multiply matrices faster
@@ Property / cites work: How to multiply matrices faster / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for algebraic decision trees
@@ Property / cites work: Lower bounds for algebraic decision trees / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
+Normal rank