Operator scaling: theory and applications
From MaRDI portal
Publication:2309517
DOI10.1007/s10208-019-09417-zzbMath1432.68617arXiv1511.03730OpenAlexW2964051254MaRDI QIDQ2309517
Publication date: 1 April 2020
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.03730
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Theory of matrix inversion and generalized inverses (15A09) Quantum computation (81P68) Commutativity of matrices (15A27) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items
Counting matchings via capacity-preserving operators, A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 $$\times $$ 2 Submatrices, Ideals of spaces of degenerate matrices, Information geometry of operator scaling, A cost-scaling algorithm for computing the degree of determinants, Connections between graphs and matrix spaces, A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with \(2 \times 2\) submatrices, Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization, On a weighted linear matroid intersection algorithm by deg-det computation, A compact representation for modular semilattices and its applications, Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces, A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with \(2\times 2\) submatrices, Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings, Spectral Analysis of Matrix Scaling and Operator Scaling, A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial degree bounds for matrix semi-invariants
- The complexity of computing the permanent
- Spaces of singular matrices and matroid parity
- Recursive unsolvability of group theoretic problems
- Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
- On computing the determinant in small parallel time using a small number of processors
- Vector spaces of matrices of low rank
- Completely positive linear maps on complex matrices
- The invariant theory of \(n\times n\) matrices
- Computational invariant theory
- A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary
- Constructive non-commutative rank computation is in deterministic polynomial time
- Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling
- Commutative/noncommutative rank of linear matrices and subspaces of matrices of low rank
- Deterministic polynomial identity testing in non-commutative models
- Classical complexity and quantum entanglement
- Inversion height in free fields
- Noncommutative rational functions, their difference-differential calculus and realizations
- Generalized Wong sequences and their applications to Edmonds' problems
- Non-commutative Edmonds' problem and matrix semi-invariants
- The Hilbert null-cone on tuples of matrices and bilinear forms
- Polynomial identity testing for depth 3 circuits
- Rational identities and applications to algebra and geometry
- Sur une généralisation du groupe orthogonal à quatre variables
- Polynomial bounds for rings of invariants
- Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing
- Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures
- Non-commutative arithmetic circuits with division
- Arithmetic Circuits: A survey of recent results and open questions
- A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume
- Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
- THE CONSTRUCTIVE THEORY OF INVARIANTS
- Singular spaces of matrices and their application in combinatorics
- The word problem for free fields: a correction and an addendum
- TRACE IDENTITIES OF FULL MATRIX ALGEBRAS OVER A FIELD OF CHARACTERISTIC ZERO
- Spaces of Matrices with Several Zero Eigenvalues
- A Prime Matrix Ideal Yields a Skew Field
- On the Parallel Evaluation of Multivariate Polynomials
- LARGE SPACES OF MATRICES OF BOUNDED RANK
- Combinatorial Nullstellensatz
- MODULI OF REPRESENTATIONS OF FINITE DIMENSIONAL ALGEBRAS
- ON THE CONSTRUCTION OF THE FREE FIELD
- Semi-invariants of quivers and saturation for Littlewood-Richardson coefficients
- Randomness efficient identity testing of multivariate polynomials
- The word problem for free fields
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- Bipartite perfect matching is in quasi-NC
- Black-box identity testing of depth-4 multilinear circuits
- Systems of distinct representatives and linear algebra
- The Embedding of Firs in Skew Fields
- The Units of Group-Rings
- Some Properties of a Sfield
- Minimal Identities for Algebras
- A THEOREM ON INDEPENDENCE RELATIONS
- Non-commutative circuits and the sum-of-squares problem
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Semi-invariants of quivers as determinants
- Semi-invariants of quivers for arbitrary dimension vectors
