Multivariate to bivariate reduction for noncommutative polynomial factorization

DOI10.1016/J.IC.2024.105223MaRDI QIDQ6647758

Vikraman Arvind, Pushkar S. Joglekar

Publication date: 3 December 2024

Published in: Information and Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• New results on noncommutative and commutative polynomial identity testing
• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
• On the complexity of noncommutative polynomial factorization
• New results on multivariate polynomial matrix factorizations
• Operator scaling: theory and applications
• Computing a nonnegative matrix factorization -- provably
• Randomized polynomial time identity testing for noncommutative circuits
• A New Algorithm for General Factorizations of Multivariate Polynomial Matrices
• Matrix Polynomials
• The Units of Group-Rings

This page was built for publication: Multivariate to bivariate reduction for noncommutative polynomial factorization

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