Kolmogorov complexity and combinatorial methods in communication complexity (Q534568): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2010.10.044
@@ Property / DOI: 10.1016/j.tcs.2010.10.044 / rank @@
-Normal rank
@@ Property / author @@
+M. A. Kaplan
@@ Property / author: M. A. Kaplan / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2010.10.044
+Normal rank
@@ Property / OpenAlex ID @@
+W2174675778
@@ Property / OpenAlex ID: W2174675778 / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential Separation of Quantum and Classical One-Way Communication Complexity
+Normal rank
@@ Property / cites work @@
+An information statistics approach to data stream and communication complexity
+Normal rank
@@ Property / cites work @@
+A strong direct product theorem for corruption and the multiparty communication complexity of disjointness
+Normal rank
@@ Property / cites work @@
+New applications of the incompressibility method. II
+Normal rank
@@ Property / cites work @@
+Individual communication complexity
@@ Property / cites work: Individual communication complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4736853
@@ Property / cites work: Q4736853 / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
+Normal rank
@@ Property / cites work @@
+Q5302084
@@ Property / cites work: Q5302084 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4519896
@@ Property / cites work: Q4519896 / rank @@
+Normal rank
@@ Property / cites work @@
+Two applications of information complexity
@@ Property / cites work: Two applications of information complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On randomized one-round communication complexity
@@ Property / cites work: On randomized one-round communication complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
+Normal rank
@@ Property / cites work @@
+Disjointness is hard in the multiparty number-on-the-forehead model
+Normal rank
@@ Property / cites work @@
+An introduction to Kolmogorov complexity and its applications
+Normal rank
@@ Property / cites work @@
+Lower bounds in communication complexity based on factorization norms
+Normal rank
@@ Property / cites work @@
+Fourier analysis for probabilistic communication complexity
+Normal rank
@@ Property / cites work @@
+Quantum communication complexity of symmetric predicates
+Normal rank
@@ Property / cites work @@
+A Mathematical Theory of Communication
@@ Property / cites work: A Mathematical Theory of Communication / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002763
@@ Property / cites work: Q3002763 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3735043
@@ Property / cites work: Q3735043 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2010.10.044
@@ Property / DOI: 10.1016/J.TCS.2010.10.044 / rank @@
+Normal rank