On the modulo degree complexity of Boolean functions (Q5918108): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2018.04.049
+Normal rank
@@ Property / OpenAlex ID @@
+W3022683369
@@ Property / OpenAlex ID: W3022683369 / rank @@
+Normal rank
@@ Property / cites work @@
+Tighter Relations between Sensitivity and Other Complexity Measures
+Normal rank
@@ Property / cites work @@
+The expressive power of voting polynomials
@@ Property / cites work: The expressive power of voting polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols
+Normal rank
@@ Property / cites work @@
+Complexity measures and decision tree complexity: a survey.
+Normal rank
@@ Property / cites work @@
+-Query Locally Decodable Codes of Subexponential Length
+Normal rank
@@ Property / cites work @@
+Query-efficient algorithms for polynomial interpolation over composites
+Normal rank
@@ Property / cites work @@
+Constructing Ramsey graphs from Boolean function representations
+Normal rank
@@ Property / cites work @@
+The complexity of Boolean functions in different characteristics
+Normal rank
@@ Property / cites work @@
+Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
+Normal rank
@@ Property / cites work @@
+Constructing set systems with prescribed intersection sizes
+Normal rank
@@ Property / cites work @@
+Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
+Normal rank
@@ Property / cites work @@
+Learning Decision Trees Using the Fourier Spectrum
+Normal rank
@@ Property / cites work @@
+Sensitivity Conjecture and Log-rank Conjecture for functions with small alternating numbers
+Normal rank
@@ Property / cites work @@
+Constant depth circuits, Fourier transform, and learnability
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Learning juntas
@@ Property / cites work: Learning juntas / rank @@
+Normal rank
@@ Property / cites work @@
+On the degree of Boolean functions as real polynomials
+Normal rank
@@ Property / cites work @@
+Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
+Normal rank
@@ Property / cites work @@
+An improved lower bound on the sensitivity complexity of graph properties
+Normal rank
@@ Property / cites work @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank
@@ Property / cites work @@
+The sum of \(D\) small-bias generators fools polynomials of degree \(D\)
+Normal rank