On the parity complexity measures of Boolean functions (Q974756): Difference between revisions

@@ 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/j.tcs.2010.03.027
+Normal rank
@@ Property / OpenAlex ID @@
+W1609754208
@@ Property / OpenAlex ID: W1609754208 / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum lower bounds by polynomials
@@ Property / cites work: Quantum lower bounds by polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity measures and decision tree complexity: a survey.
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+CREW PRAM<scp>s</scp> and Decision Trees
@@ Property / cites work: CREW PRAM<scp>s</scp> and Decision Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q3396635
@@ Property / cites work: Q3396635 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3636247
@@ Property / cites work: Q3636247 / rank @@
+Normal rank