Linear algebraic methods in communication complexity (Q417541): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+A99
@@ Property / Mathematics Subject Classification ID: 15A99 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6034506
@@ Property / zbMATH DE Number: 6034506 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+communication complexity
@@ Property / zbMATH Keywords: communication complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+matrix rank
@@ Property / zbMATH Keywords: matrix rank / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+minimum rank
@@ Property / zbMATH Keywords: minimum rank / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+sign rank
@@ Property / zbMATH Keywords: sign rank / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+randomization
@@ Property / zbMATH Keywords: randomization / 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.laa.2011.07.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2000545126
@@ Property / OpenAlex ID: W2000545126 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821526
@@ Property / cites work: Q4821526 / rank @@
+Normal rank
@@ Property / cites work @@
+Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
+Normal rank
@@ Property / cites work @@
+Matrix rank and communication complexity
@@ Property / cites work: Matrix rank and communication complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
+Normal rank
@@ Property / cites work @@
+Q4065548
@@ Property / cites work: Q4065548 / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum rank of symmetric matrices described by a graph: a survey
+Normal rank
@@ Property / cites work @@
+A linear lower bound on the unbounded error probabilistic communication complexity.
+Normal rank
@@ Property / cites work @@
+Quick approximation to matrices and applications
@@ Property / cites work: Quick approximation to matrices and applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q4320535
@@ Property / cites work: Q4320535 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4217269
@@ Property / cites work: Q4217269 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on minimum rank and maximum nullity of sign patterns
+Normal rank
@@ Property / cites work @@
+Monotone Circuits for Connectivity Require Super-Logarithmic Depth
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Lower Bounds using Linear Algebra
@@ Property / cites work: Complexity Lower Bounds using Linear Algebra / rank @@
+Normal rank
@@ Property / cites work @@
+Communication complexity and combinatorial lattice theory
+Normal rank
@@ Property / cites work @@
+On rank vs. communication complexity
@@ Property / cites work: On rank vs. communication complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic communication complexity
@@ Property / cites work: Probabilistic communication complexity / rank @@
+Normal rank
@@ Property / cites work @@
+The Sign-Rank of AC$^0$
@@ Property / cites work: The Sign-Rank of AC$^0$ / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for predecessor searching in the cell probe model
+Normal rank
@@ Property / cites work @@
+Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
+Normal rank
@@ Property / cites work @@
+Expressing combinatorial optimization problems by linear programs
+Normal rank
@@ Property / cites work @@
+Q3735043
@@ Property / cites work: Q3735043 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:417541