The direct sum of universal relations (Q1751432): Difference between revisions

@@ Property / cites work @@
+How to compress interactive communication
@@ Property / cites work: How to compress interactive communication / rank @@
+Normal rank
@@ Property / cites work @@
+On the direct sum conjecture in the straight line model
+Normal rank
@@ Property / cites work @@
+Communication complexity towards lower bounds on circuit depth
+Normal rank
@@ Property / cites work @@
+Amortized Communication Complexity
@@ Property / cites work: Amortized Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of 2-output Boolean networks
@@ Property / cites work: On the complexity of 2-output Boolean networks / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential separation of communication and external information
+Normal rank
@@ Property / cites work @@
+Q4287360
@@ Property / cites work: Q4287360 / rank @@
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Super-logarithmic depth lower bounds via the direct sum in communication complexity
+Normal rank
@@ Property / cites work @@
+Monotone Circuits for Connectivity Require Super-Logarithmic Depth
+Normal rank
@@ Property / cites work @@
+Realizing Boolean functions on disjoint sets of variables
+Normal rank
@@ Property / cites work @@
+Separation of the monotone NC hierarchy
@@ Property / cites work: Separation of the monotone NC hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Monotone circuits for matching require linear depth
+Normal rank
@@ Property / cites work @@
+On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements
+Normal rank