Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits (Q3196385): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2339207536
@@ Property / OpenAlex ID: W2339207536 / 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 @@
+Mining circuit lower bound proofs for meta-algorithms
+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 @@
+Q5743451
@@ Property / cites work: Q5743451 / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandomness from Shrinkage
@@ Property / cites work: Pseudorandomness from Shrinkage / 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 @@
+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 @@
+A satisfiability algorithm and average-case hardness for formulas over the full binary basis
+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
@@ links / mardi / name / links / mardi / name @@
+Publication:3196385