Correlation bounds and \#SAT algorithms for small linear-size circuits (Q344759): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2016.05.005
+Normal rank
@@ Property / OpenAlex ID @@
+W1625693084
@@ Property / OpenAlex ID: W1625693084 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / 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 @@
+A Boolean function requiring 3n network size
@@ Property / cites work: A Boolean function requiring 3n network size / rank @@
+Normal rank
@@ Property / cites work @@
+On the construction of affine extractors
@@ Property / cites work: On the construction of affine extractors / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas
+Normal rank
@@ Property / cites work @@
+An Elementary Proof of a 3n − o(n) Lower Bound on the Circuit Complexity of Affine Dispersers
+Normal rank
@@ Property / cites work @@
+The Shrinkage Exponent of de Morgan Formulas is 2
@@ Property / cites work: The Shrinkage Exponent of de Morgan Formulas is 2 / rank @@
+Normal rank
@@ Property / cites work @@
+Fourier concentration from shrinkage
@@ Property / cites work: Fourier concentration from shrinkage / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743451
@@ Property / cites work: Q5743451 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4708583
@@ Property / cites work: Q4708583 / rank @@
+Normal rank
@@ Property / cites work @@
+Average-case lower bounds for formula size
@@ Property / cites work: Average-case lower bounds for formula size / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit lower bound of             <i>4.5n - o(n)</i>             for boolena circuits
+Normal rank
@@ Property / cites work @@
+Analysis of Boolean Functions
@@ Property / cites work: Analysis of Boolean Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365063
@@ Property / cites work: Q5365063 / rank @@
+Normal rank
@@ Property / cites work @@
+Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen
+Normal rank
@@ Property / cites work @@
+Q3281059
@@ Property / cites work: Q3281059 / rank @@
+Normal rank
@@ Property / cites work @@
+Affine extractors over prime fields
@@ Property / cites work: Affine extractors over prime fields / rank @@
+Normal rank
@@ Property / cites work @@
+A $4n$ Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions
+Normal rank