On the complexity of noncommutative polynomial factorization

DOI10.1007/978-3-662-48054-0_4MaRDI QIDQ6827797zbMATH OpenFDO

Authors Vikraman Arvind, Gaurav Rattan, Pushkar S. Joglekar

Publication date 16 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Associative rings determined by universal properties (free algebras, coproducts, adjunction of inverses, etc.) (16S10)

This page was built for publication: On the complexity of noncommutative polynomial factorization

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