Author:
Arvind V.,Rattan Gaurav,Joglekar Pushkar
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Allender, E., Beals, R., Ogihara, M.: The complexity of matrix rank and feasible systems of linear equations. Comput. Complex. 8(2), 99–126 (1999)
2. Lecture Notes in Computer Science;A Bhattacharyya,2014
3. Arvind, V., Joglekar, P.S., Rattan, G.: On the complexity of noncommutative polynomial factorization. Electronic Colloquium on Computational Complexity, TR15-004 (2015)
4. Beimel, A., Bergadano, F., Bshouty, N.H., Kushilevitz, E., Varricchio, S.: Learning functions represented as multiplicity automata. J. ACM 47(3), 506–530 (2000)
5. Bogdanov, A., Wee, H.: More on noncommutative polynomial identity testing. In: Proceedings of 20th Annual Conference on Computational Complexity (CCC), pp. 92–99 (2005)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献