On the binary and Boolean rank of regular matrices (Q2689370): Difference between revisions

@@ Property / cites work @@
+Some improved bounds on communication complexity via new decomposition of cliques
+Normal rank
@@ Property / cites work @@
+Low-Sensitivity Functions from Unambiguous Certificates.
+Normal rank
@@ Property / cites work @@
+Improving the Hadamard extractor
@@ Property / cites work: Improving the Hadamard extractor / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition techniques applied to the clique-stable set separation problem
+Normal rank
@@ Property / cites work @@
+Clique versus independent set
@@ Property / cites work: Clique versus independent set / rank @@
+Normal rank
@@ Property / cites work @@
+On the minimum rank of regular classes of matrices of zeros and ones
+Normal rank
@@ Property / cites work @@
+Query-to-Communication Lifting Using Low-Discrepancy Gadgets
+Normal rank
@@ Property / cites work @@
+Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
+Normal rank
@@ Property / cites work @@
+Subdivided claws and the clique-stable set separation property
+Normal rank
@@ Property / cites work @@
+More counterexamples to the Alon-Saks-Seymour and rank-coloring conjectures
+Normal rank
@@ Property / cites work @@
+Q3961028
@@ Property / cites work: Q3961028 / rank @@
+Normal rank
@@ Property / cites work @@
+Rectangles Are Nonnegative Juntas
@@ Property / cites work: Rectangles Are Nonnegative Juntas / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic Communication vs. Partition Number
@@ Property / cites work: Deterministic Communication vs. Partition Number / rank @@
+Normal rank
@@ Property / cites work @@
+On the Addressing Problem for Loop Switching
@@ Property / cites work: On the Addressing Problem for Loop Switching / rank @@
+Normal rank
@@ Property / cites work @@
+Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices
+Normal rank
@@ Property / cites work @@
+Q4207933
@@ Property / cites work: Q4207933 / rank @@
+Normal rank
@@ Property / cites work @@
+A counterexample to the Alon-Saks-Seymour conjecture and related problems
+Normal rank
@@ Property / cites work @@
+Boolean function complexity. Advances and frontiers.
+Normal rank
@@ Property / cites work @@
+Q4326643
@@ Property / cites work: Q4326643 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs
+Normal rank
@@ Property / cites work @@
+Clique-stable set separation in perfect graphs with no balanced skew-partitions
+Normal rank
@@ Property / cites work @@
+Recent advances on the log-rank conjecture in communication complexity
+Normal rank
@@ Property / cites work @@
+Q4846548
@@ Property / cites work: Q4846548 / rank @@
+Normal rank
@@ Property / cites work @@
+The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear
+Normal rank
@@ Property / cites work @@
+Ordered biclique partitions and communication complexity problems
+Normal rank
@@ Property / cites work @@
+Expressing combinatorial optimization problems by linear programs
+Normal rank