An improved lower bound on the sensitivity complexity of graph properties (Q551172): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2011.02.042
@@ Property / DOI: 10.1016/j.tcs.2011.02.042 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C69
@@ Property / Mathematics Subject Classification ID: 05C69 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q15
@@ Property / Mathematics Subject Classification ID: 68Q15 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+5920429
@@ Property / zbMATH DE Number: 5920429 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational complexity
@@ Property / zbMATH Keywords: computational complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+decision tree complexity
@@ Property / zbMATH Keywords: decision tree complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+sensitivity complexity
@@ Property / zbMATH Keywords: sensitivity complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph property
@@ Property / zbMATH Keywords: graph property / 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/j.tcs.2011.02.042
+Normal rank
@@ Property / OpenAlex ID @@
+W2039999266
@@ Property / OpenAlex ID: W2039999266 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity measures and decision tree complexity: a survey.
+Normal rank
@@ Property / cites work @@
+On induced subgraphs of the cube
@@ Property / cites work: On induced subgraphs of the cube / rank @@
+Normal rank
@@ Property / cites work @@
+Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
+Normal rank
@@ Property / cites work @@
+The equivalence of two problems on the cube
@@ Property / cites work: The equivalence of two problems on the cube / rank @@
+Normal rank
@@ Property / cites work @@
+Sensitivity, block sensitivity, and \(\ell\)-block sensitivity of Boolean functions
+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 @@
+On the degree of Boolean functions as real polynomials
+Normal rank
@@ Property / cites work @@
+Q3674058
@@ Property / cites work: Q3674058 / rank @@
+Normal rank
@@ Property / cites work @@
+The critical complexity of graph properties
@@ Property / cites work: The critical complexity of graph properties / rank @@
+Normal rank
@@ Property / cites work @@
+Q3691584
@@ Property / cites work: Q3691584 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2011.02.042
@@ Property / DOI: 10.1016/J.TCS.2011.02.042 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:551172