Some structural properties of low-rank matrices related to computational complexity
From MaRDI portal
Publication:1978702
Recommendations
Cites work
- scientific article; zbMATH DE number 4008289 (Why is no real title available?)
- scientific article; zbMATH DE number 17660 (Why is no real title available?)
- scientific article; zbMATH DE number 3597878 (Why is no real title available?)
- scientific article; zbMATH DE number 3200675 (Why is no real title available?)
- A note on matrix rigidity
- Boolean Circuits, Tensor Ranks, and Communication Complexity
- Combinatorial matrix theory
- Concerning nonnegative matrices and doubly stochastic matrices
- Explicit Ramsey graphs and orthonormal labelings
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Intersection Theorems for Systems of Sets
- Large sets of nearly orthogonal vectors
- Matrix Factorization over $GF(2)$ and Trace-Orthogonal Bases of $GF(2^n )$
- On finite set-systems whose every intersection is a kernel of a star
- On rank vs. communication complexity
- The rank and size of graphs
- Top-down lower bounds for depth-three circuits
Cited in
(23)- Constructive lower bounds for off-diagonal Ramsey numbers
- Perturbed Identity Matrices Have High Rank: Proof and Applications
- On minrank and forbidden subgraphs
- Fractional \(L\)-intersecting families
- On covering graphs by complete bipartite subgraphs
- On some open questions for Ramsey and Folkman numbers
- Sets of unit vectors with small subset sums
- Hasse diagrams with large chromatic number
- Matrix rank and communication complexity
- Rigidity of a simple extended lower triangular matrix
- Some constructive bounds on Ramsey numbers
- On the correlation measures of subsets
- Cycles of nonzero elements in low rank matrices
- A polynomial-time algorithm for computing low CP-rank decompositions
- On a theorem of Razborov
- A small step forwards on the Erdős-Sós problem concerning the Ramsey numbers \(R(3, k)\)
- On almost-equidistant sets. II
- Matrix rigidity
- On graphs and algebraic graphs that do not contain cycles of length 4
- Lovász, vectors, graphs and codes
- Orthonormal representations of \(H\)-free graphs
- Some recent results on Ramsey-type numbers
- Small Sample Spaces Cannot Fool Low Degree Polynomials
This page was built for publication: Some structural properties of low-rank matrices related to computational complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978702)
