Keyword

bilinear complexity

Description: A measure of the number of bilinear operations needed to compute a bilinear map, studied in algebraic complexity and finite-field arithmetic.
OpenAlex ID: keywords/bilinear-complexity
2020 · Qian Yu, Mohammad Ali Maddah-Ali, et al. · IEEE Transactions on Information Theory · 318
2014 · François Le Gall · International Symposium on Symbolic and Algebraic Computation · 243
2013 · A. V. Smirnov · Computational Mathematics and Mathematical Physics · 135
2018 · Qian Yu, Mohammad Ali Maddah-Ali, et al. · IEEE International Symposium on Information Theory (ISIT) · 117
2005 · J. Landsberg · Journal of the American Mathematical Society · 93
1992 · Julian Laderman, Victor Pan, et al. · Linear Algebra and its Applications · 93
2003 · Markus Bläser · Journal of Complexity · 92
1999 · Stéphane Ballet · Finite Fields and Their Applications · 60
1983 · A. Lempel, G. Seroussi, et al. · Theoretical Computer Science · 57
1987 · Hans F. de Groote · Lecture notes in computer science · 54
2009 · Murat Cenk, Ferruh Özbudak · Journal of Complexity · 52
2003 · S. Ballet, R. Rolland · Journal of Algebra · 50
1976 · Robert L. Probert · SIAM Journal on Computing · 50
2012 · Hugues Randriambololona · Journal of Complexity · 49
1992 · Mohammad Amin Shokrollahi · SIAM Journal on Computing · 43
2022 · Kuan-Lin Chen, Harinath Garudadri, et al. · neural information processing systems · 40
2005 · Yves Aubry, Gilles Lachaud · HAL · 31
2016 · Ke Ye, Lek-Heng Lim · Foundations of Computational Mathematics · 23
2006 · N. Arnaud · OpenGrey (Institut de l'Information Scientifique et Technique) · 23
2005 · Stéphane Ballet, Dominique Le Brig, et al. · HAL · 23
2004 · St�phane Ballet, Jean Chaumine · Applicable Algebra in Engineering Communication and Computing · 23
2000 · M. Bläser · Computational Complexity · 23
1983 · Hans F. de Groote, Joos Heintz · Linear Algebra and its Applications · 23
Works count: 133
Citation count: 1,868
Year
Topic
Type