Matrix Polynomial Factorization via Higman Linearization

In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose entries $M_{ij}$ are polynomials in the free noncommutative rin...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Arvind, V, Joglekar, Pushkar S
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Complexity
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!