Polynomial-time quantum algorithms for finding the linear structures of Boolean function (Q2347659): Difference between revisions

@@ Property / author @@
+WanQing Wu
@@ Property / author: WanQing Wu / 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.1007/s11128-015-0940-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2090472886
@@ Property / OpenAlex ID: W2090472886 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear symmetries of Boolean functions.
@@ Property / cites work: Linear symmetries of Boolean functions. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4484887
@@ Property / cites work: Q4484887 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4359590
@@ Property / cites work: Q4359590 / rank @@
+Normal rank
@@ Property / cites work @@
+Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\)
+Normal rank
@@ Property / cites work @@
+Characterization of linear structures
@@ Property / cites work: Characterization of linear structures / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of realization of a linear Boolean function in Sheffer's basis
+Normal rank
@@ Property / cites work @@
+Q3994535
@@ Property / cites work: Q3994535 / rank @@
+Normal rank