Operator Scaling: Theory and Applications

In this paper, we present a deterministic polynomial time algorithm for testing whether a symbolic matrix in non-commuting variables over Q is invertible or not. The analogous question for commuting variables is the celebrated polynomial identity testing (PIT) for symbolic determinants. In contrast...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Foundations of computational mathematics Ročník 20; číslo 2; s. 223 - 290
Hlavní autoři:	Garg, Ankit, Gurvits, Leonid, Oliveira, Rafael, Wigderson, Avi
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.04.2020 Springer Nature B.V
Témata:	Algorithms Applications of Mathematics Approximation Commuting Complexity Computer Science Economics Information theory Linear algebra Linear and Multilinear Algebras Lower bounds Math Applications in Computer Science Mathematics Mathematics and Statistics Matrices (mathematics) Matrix Theory Numerical Analysis Operators (mathematics) Optimization Polynomials Quantum computing Quantum phenomena Questions System theory Systems theory Non-commutative algebra 68Q25 Quantum operators Polynomial identity testing Invariant theory Derandomization 68Q10
ISSN:	1615-3375, 1615-3383
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!