Author:
Chaugule Prasad,Limaye Nutan
Publisher
Springer International Publishing
Reference17 articles.
1. Allender, E., Wang, F.: On the power of algebraic branching programs of width two. Comput. Complex. 25(1), 217–253 (2016)
2. Bini, D.: Relations between exact and approximate bilinear algorithms. Applications. Calcolo 17(1), 87–97 (1980)
3. Bini, D.A., Capovani, M., Romani, F., Lotti, G.: O($$n^{2. 7799}$$) complexity for $$n \times n$$ approximate matrix multiplication (1979)
4. Bläser, M., Ikenmeyer, C., Mahajan, M., Pandey, A., Saurabh, N.: Algebraic branching programs, border complexity, and tangent spaces. In: 35th Computational Complexity Conference, CCC 2020. LIPIcs, vol. 169, pp. 21:1–21:24 (2020)
5. Bringmann, K., Ikenmeyer, C., Zuiddam, J.: On algebraic branching programs of small width. J. ACM (JACM) 65(5), 1–29 (2018)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献