A linear lower bound on the unbounded error probabilistic communication complexity. (Q1872728): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4781229
@@ Property / cites work: Q4781229 / rank @@
+Normal rank
@@ Property / cites work @@
+Learnability and the Vapnik-Chervonenkis dimension
+Normal rank
@@ Property / cites work @@
+Q4474216
@@ Property / cites work: Q4474216 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4781230
@@ Property / cites work: Q4781230 / rank @@
+Normal rank
@@ Property / cites work @@
+Relative loss bounds for temporal-difference learning
+Normal rank
@@ Property / cites work @@
+Matrix Analysis
@@ Property / cites work: Matrix Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric arguments yield better bounds for threshold circuits and distributed computing
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic communication complexity
@@ Property / cites work: Probabilistic communication complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4405392
@@ Property / cites work: Q4405392 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4261789
@@ Property / cites work: Q4261789 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0022-0000(02)00019-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2143355494
@@ Property / OpenAlex ID: W2143355494 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1872728