The four Russians' algorithm for boolean matrix multiplication is optimal in its class
Dana Angluin · ACM SIGACT News · 1976
article Free Access Share on The four Russians' algorithm for boolean matrix multiplication is optimal in its class Author: Dana Angluin University of California, Berkeley University of California, BerkeleyView Profile Authors Info & Claims ACM SIGACT NewsVolume 8Issue 1January-March 1976 pp 29–33https://doi.org/10.1145/1008591.1008593Published:01 January 1976Publication History 4citation537DownloadsMetricsTotal Citations4Total Downloads537Last 12 Months30Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF