On efficient noncommutative polynomial factorization via Higman linearization

DOI10.1007/S00037-025-00272-9MaRDI QIDQ6938571zbMATH OpenFDO

Authors Vikraman Arvind, Pushkar S. Joglekar

Publication date 25 August 2025

Published in Computational Complexity (Search for Journal in Brave)

zbMATH Keywords

factorizationinvariant subspacesnoncommutative polynomialsidentity testinglinear matricesHigman linearization

Mathematics Subject Classification ID

Associative rings and algebras (16-XX)

This page was built for publication: On efficient noncommutative polynomial factorization via Higman linearization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6938571)