On the power of small-depth threshold circuits (Q685717): Difference between revisions

@@ Property / cites work @@
+\(\Sigma_ 1^ 1\)-formulae on finite structures
@@ Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank @@
+Normal rank
@@ Property / cites work @@
+The monotone circuit complexity of Boolean functions
+Normal rank
@@ Property / cites work @@
+Q4302459
@@ Property / cites work: Q4302459 / rank @@
+Normal rank
@@ Property / cites work @@
+Constant Depth Reducibility
@@ Property / cites work: Constant Depth Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
+Normal rank
@@ Property / cites work @@
+Parity, circuits, and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+Monotone Circuits for Connectivity Require Super-Logarithmic Depth
+Normal rank
@@ Property / cites work @@
+Monotone circuits for matching require linear depth
+Normal rank
@@ Property / cites work @@
+Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01272517
+Normal rank
@@ Property / OpenAlex ID @@
+W2107998050
@@ Property / OpenAlex ID: W2107998050 / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/cc/HastadG91
@@ Property / DBLP publication ID: journals/cc/HastadG91 / rank @@
+Normal rank