On the Complexity of Noncommutative Polynomial Factorization.
Vikraman ArvindGaurav RattanPushkar S. JoglekarPublished in: MFCS (2) (2015)
Keyphrases
- worst case
- vapnik chervonenkis dimension
- computational complexity
- polynomial hierarchy
- average case complexity
- computer vision
- computational cost
- exponential size
- complexity analysis
- decision problems
- polynomial size
- space complexity
- matrix factorization
- data sets
- evolutionary algorithm
- artificial neural networks
- machine learning