|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
Application of Approximating Algorithms to Boolean Matrix Multiplication
October 1980 (vol. 29 no. 10)
pp. 927-928
| ASCII Text | x | ||
| G. Lotti, F. Romani, "Application of Approximating Algorithms to Boolean Matrix Multiplication," IEEE Transactions on Computers, vol. 29, no. 10, pp. 927-928, October, 1980. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1980.1675476, author = {G. Lotti and F. Romani}, title = {Application of Approximating Algorithms to Boolean Matrix Multiplication}, journal ={IEEE Transactions on Computers}, volume = {29}, number = {10}, issn = {0018-9340}, year = {1980}, pages = {927-928}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1980.1675476}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Application of Approximating Algorithms to Boolean Matrix Multiplication IS - 10 SN - 0018-9340 SP927 EP928 EPD - 927-928 A1 - G. Lotti, A1 - F. Romani, PY - 1980 KW - integer matrices KW - Analysis of algorithms KW - approximating algorithms KW - Boolean matrix multiplication KW - computational complexity VL - 29 JA - IEEE Transactions on Computers ER - | |||
Bounded integer matrices are matrices whose entries are bounded integers.
Index Terms:
integer matrices, Analysis of algorithms, approximating algorithms, Boolean matrix multiplication, computational complexity
Citation:
G. Lotti, F. Romani, "Application of Approximating Algorithms to Boolean Matrix Multiplication," IEEE Transactions on Computers, vol. 29, no. 10, pp. 927-928, Oct. 1980, doi:10.1109/TC.1980.1675476
Usage of this product signifies your acceptance of the Terms of Use.

