Pages that link to "Item:Q1978702"
From MaRDI portal
The following pages link to Some structural properties of low-rank matrices related to computational complexity (Q1978702):
Displaying 22 items.
- A small step forwards on the Erdős-Sós problem concerning the Ramsey numbers \(R(3, k)\) (Q317436) (← links)
- A polynomial-time algorithm for computing low CP-rank decompositions (Q344517) (← links)
- Some recent results on Ramsey-type numbers (Q385143) (← links)
- On a theorem of Razborov (Q445247) (← links)
- Rigidity of a simple extended lower triangular matrix (Q963424) (← links)
- Some constructive bounds on Ramsey numbers (Q974470) (← links)
- On covering graphs by complete bipartite subgraphs (Q1025967) (← links)
- Matrix rigidity (Q1970501) (← links)
- Matrix rank and communication complexity (Q1970502) (← links)
- Fractional \(L\)-intersecting families (Q2001971) (← links)
- On the correlation measures of subsets (Q2189560) (← links)
- Orthonormal representations of \(H\)-free graphs (Q2207591) (← links)
- On almost-equidistant sets. II (Q2415075) (← links)
- Sets of unit vectors with small subset sums (Q2796088) (← links)
- On graphs and algebraic graphs that do not contain cycles of length 4 (Q3174238) (← links)
- Lovász, Vectors, Graphs and Codes (Q3295262) (← links)
- Small Sample Spaces Cannot Fool Low Degree Polynomials (Q3541801) (← links)
- Perturbed Identity Matrices Have High Rank: Proof and Applications (Q3557502) (← links)
- Hasse diagrams with large chromatic number (Q5006387) (← links)
- (Q5009538) (← links)
- On Some Open Questions for Ramsey and Folkman Numbers (Q5506775) (← links)
- Constructive lower bounds for off-diagonal Ramsey numbers (Q5935811) (← links)
