On the complexity of noncommutative polynomial factorization

Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan. On the complexity of noncommutative polynomial factorization. Inf. Comput., 262(Part):22-39, 2018. [doi]

@article{ArvindJR18,
  title = {On the complexity of noncommutative polynomial factorization},
  author = {Vikraman Arvind and Pushkar S. Joglekar and Gaurav Rattan},
  year = {2018},
  doi = {10.1016/j.ic.2018.05.009},
  url = {https://doi.org/10.1016/j.ic.2018.05.009},
  researchr = {https://researchr.org/publication/ArvindJR18},
  cites = {0},
  citedby = {0},
  journal = {Inf. Comput.},
  volume = {262},
  number = {Part},
  pages = {22-39},
}