"On the complexity of noncommutative polynomial factorization."

Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan (2018)

> Home

Details and statistics

DOI: 10.1016/J.IC.2018.05.009

access: closed

type: Journal Article

metadata version: 2020-11-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/iandc/ArvindJR18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/ArvindJR18
Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan:
On the complexity of noncommutative polynomial factorization. Inf. Comput. 262: 22-39 (2018)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.