The factor width rank of a matrix
From MaRDI portal
Cites work
- \(\{0,1\}\) completely positive matrices
- A quantitative theory of coherent delocalization
- An iterative criterion for \(H\)-matrices
- Approximation Algorithms for the k-Clique Covering Problem
- Asymptotically optimal covering designs
- Bemerkungen zur Theorie der beschränkten Bilinearformen mit unendlich vielen Veränderlichen.
- Critical exponents of graphs
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Entanglement breaking rank and the existence of SIC POVMs
- scientific article; zbMATH DE number 3116601 (Why is no real title available?)
- scientific article; zbMATH DE number 1220661 (Why is no real title available?)
- scientific article; zbMATH DE number 3198027 (Why is no real title available?)
- Minimal coverings of pairs by triples
- On coverings
- On factor width and symmetric \(H\)-matrices
- On fractional Hadamard powers of positive definite matrices
- On the covering of pairs by quadruples. I
- On the covering of pairs by quadruples. II
- On the mixed-unitary rank of quantum channels
- Positive semidefinite matrices with a given sparsity pattern
- Positivity of Hadamard powers of a few band matrices
- Schur products and matrix completions
- The \(\mathrm{PPT}^2\) conjecture holds for all Choi-type maps
- The maximal cp-rank of rank k completely positive matrices
- The theory of quantum information
- Twirling channels have minimal mixed-unitary rank
- Zero forcing sets and the minimum rank of graphs
This page was built for publication: The factor width rank of a matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6994749)
