default search action
"O(n2.7799) Complexity for n*n Approximate Matrix Multiplication."
Dario Bini et al. (1979)
- Dario Bini, Milvio Capovani, Francesco Romani, Grazia Lotti:
O(n2.7799) Complexity for n*n Approximate Matrix Multiplication. Inf. Process. Lett. 8(5): 234-235 (1979)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.