A note on the use of determinant for proving lower bounds on the size of linear circuits (Q294768): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q5619190
@@ Property / cites work: Q5619190 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4331740
@@ Property / cites work: Q4331740 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4109584
@@ Property / cites work: Q4109584 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4231904
@@ Property / cites work: Q4231904 / rank @@
+Normal rank
@@ Property / cites work @@
+Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
+Normal rank
@@ Property / cites work @@
+The Linear Complexity of Computation
@@ Property / cites work: The Linear Complexity of Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234123
@@ Property / cites work: Q4234123 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved lower bounds on the rigidity of Hadamard matrices
+Normal rank
@@ Property / cites work @@
+Q4164821
@@ Property / cites work: Q4164821 / rank @@
+Normal rank