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]

Authors

Vikraman Arvind

This author has not been identified. Look up 'Vikraman Arvind' in Google

Pushkar S. Joglekar

This author has not been identified. Look up 'Pushkar S. Joglekar' in Google

Gaurav Rattan

This author has not been identified. Look up 'Gaurav Rattan' in Google