Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. A boolean function requiring 3n network size;Blum;Theoret. Comput. Sci.,1984
2. Optimal evaluation of pairs of bilinear forms;Ja'Ja';SIAM J. Comput.,1979
3. On the complexity of bilinear forms;Ja'Ja';SIAM J. Comput.,1980
4. The multiplicative complexity of quadratic boolean forms;Mirwald;Proc. 28th IEEE Symp. on Foundations of Computer Science,1987
5. Characterization of the rank of a pair of matrices over Z2;Mirwald,1990
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献