The multiplicative complexity of quadratic boolean forms (Q1199694): Difference between revisions

@@ Property / author @@
-Claus Peter Schnorr
@@ Property / author: Claus Peter Schnorr / rank @@
-Normal rank
@@ Property / author @@
+Claus Peter Schnorr
@@ Property / author: Claus Peter Schnorr / rank @@
+Normal rank
@@ 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(92)90235-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2026273432
@@ Property / OpenAlex ID: W2026273432 / rank @@
+Normal rank
@@ Property / cites work @@
+A Boolean function requiring 3n network size
@@ Property / cites work: A Boolean function requiring 3n network size / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Evaluation of Pairs of Bilinear Forms
@@ Property / cites work: Optimal Evaluation of Pairs of Bilinear Forms / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Bilinear Forms with Commutativity
+Normal rank
@@ Property / cites work @@
+The multiplicative complexity of quadratic boolean forms
+Normal rank
@@ Property / cites work @@
+Q4724549
@@ Property / cites work: Q4724549 / rank @@
+Normal rank
@@ Property / cites work @@
+A 3n-lower bound on the network complexity of Boolean functions
+Normal rank
@@ Property / cites work @@
+A Gödel Theorem on Network Complexity Lower Bounds
+Normal rank
@@ Property / cites work @@
+Q3316588
@@ Property / cites work: Q3316588 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4047029
@@ Property / cites work: Q4047029 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3690212
@@ Property / cites work: Q3690212 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221885
@@ Property / cites work: Q3221885 / rank @@
+Normal rank