Simulation theorems via pseudo-random properties (Q2281252): Difference between revisions

@@ Property / arXiv ID @@
+.06807
@@ Property / arXiv ID: 1704.06807 / rank @@
+Normal rank
@@ Property / cites work @@
+How to Compress Interactive Communication
@@ Property / cites work: How to Compress Interactive Communication / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness amplification in proof complexity
@@ Property / cites work: Hardness amplification in proof complexity / rank @@
+Normal rank
@@ Property / cites work @@
+A strong direct product theorem for corruption and the multiparty communication complexity of disjointness
+Normal rank
@@ Property / cites work @@
+On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
+Normal rank
@@ Property / cites work @@
+Information Equals Amortized Communication
@@ Property / cites work: Information Equals Amortized Communication / rank @@
+Normal rank
@@ Property / cites work @@
+Direct Product via Round-Preserving Compression
@@ Property / cites work: Direct Product via Round-Preserving Compression / rank @@
+Normal rank
@@ Property / cites work @@
+Towards a reverse Newman's theorem in interactive information complexity
+Normal rank
@@ Property / cites work @@
+Q3568106
@@ Property / cites work: Q3568106 / rank @@
+Normal rank
@@ Property / cites work @@
+The NOF Multiparty Communication Complexity of Composed Functions
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Elimination via Weak Regularity
@@ Property / cites work: Lower Bounds for Elimination via Weak Regularity / rank @@
+Normal rank
@@ Property / cites work @@
+Query-To-Communication Lifting for BPP Using Inner Product
+Normal rank
@@ Property / cites work @@
+Improved Separations between Nondeterministic and Randomized Multiparty Communication
+Normal rank
@@ Property / cites work @@
+Improved direct product theorems for randomized query complexity
+Normal rank
@@ Property / cites work @@
+A short proof for a theorem of Harper about Hamming-spheres
+Normal rank
@@ Property / cites work @@
+Q5111142
@@ Property / cites work: Q5111142 / rank @@
+Normal rank
@@ Property / cites work @@
+Rectangles Are Nonnegative Juntas
@@ Property / cites work: Rectangles Are Nonnegative Juntas / rank @@
+Normal rank
@@ Property / cites work @@
+Communication lower bounds via critical block sensitivity
+Normal rank
@@ Property / cites work @@
+Deterministic Communication vs. Partition Number
@@ Property / cites work: Deterministic Communication vs. Partition Number / rank @@
+Normal rank
@@ Property / cites work @@
+Query-to-Communication Lifting for BPP
@@ Property / cites work: Query-to-Communication Lifting for BPP / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal numberings and isoperimetric problems on graphs
+Normal rank
@@ Property / cites work @@
+The Communication Complexity of Correlation
@@ Property / cites work: The Communication Complexity of Correlation / rank @@
+Normal rank
@@ Property / cites work @@
+Structure of Protocols for XOR Functions
@@ Property / cites work: Structure of Protocols for XOR Functions / rank @@
+Normal rank
@@ Property / cites work @@
+On the virtue of succinct proofs
@@ Property / cites work: On the virtue of succinct proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252738
@@ Property / cites work: Q4252738 / rank @@
+Normal rank
@@ Property / cites work @@
+New Strong Direct Product Results in Communication Complexity
+Normal rank
@@ Property / cites work @@
+Q5302084
@@ Property / cites work: Q5302084 / rank @@
+Normal rank
@@ Property / cites work @@
+A direct product theorem for two-party bounded-round public-coin communication complexity
+Normal rank
@@ Property / cites work @@
+Q4449184
@@ Property / cites work: Q4449184 / rank @@
+Normal rank
@@ Property / cites work @@
+Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits
+Normal rank
@@ Property / cites work @@
+Monotone Circuits for Connectivity Require Super-Logarithmic Depth
+Normal rank
@@ Property / cites work @@
+Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Composition Theorems in Communication Complexity
@@ Property / cites work: Composition Theorems in Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+One way functions and pseudorandom generators
@@ Property / cites work: One way functions and pseudorandom generators / rank @@
+Normal rank
@@ Property / cites work @@
+Lifting Theorems for Equality
@@ Property / cites work: Lifting Theorems for Equality / rank @@
+Normal rank
@@ Property / cites work @@
+Q4601824
@@ Property / cites work: Q4601824 / rank @@
+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 @@
+Towards proving strong direct product theorems
@@ Property / cites work: Towards proving strong direct product theorems / rank @@
+Normal rank
@@ Property / cites work @@
+Separating ${AC}^0$ from Depth-2 Majority Circuits
+Normal rank
@@ Property / cites work @@
+The Pattern Matrix Method
@@ Property / cites work: The Pattern Matrix Method / rank @@
+Normal rank
@@ Property / cites work @@
+The multiparty communication complexity of set disjointness
+Normal rank
@@ Property / cites work @@
+Strong Direct Product Theorems for Quantum Communication and Query Complexity
+Normal rank
@@ Property / cites work @@
+Communication lower bounds using directional derivatives
+Normal rank
@@ Property / cites work @@
+Q3633949
@@ Property / cites work: Q3633949 / rank @@
+Normal rank
@@ Property / cites work @@
+Dag-like communication and its applications
@@ Property / cites work: Dag-like communication and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002796
@@ Property / cites work: Q3002796 / rank @@
+Normal rank
@@ Property / cites work @@
+Expressing combinatorial optimization problems by linear programs
+Normal rank