A geometric approach to Boolean matrix multiplication
Författare
Summary, in English
Avdelning/ar
- Computer Science
Publiceringsår
2002
Språk
Engelska
Sidor
501-510
Publikation/Tidskrift/Serie
Algorithms and Computation : 13th International Symposium, ISAAC 2002, Vancouver, BC, Canada, November 21-23, 2002. Proceedings (Lecture Notes in Computer Science)
Volym
2518
Länkar
Dokumenttyp
Konferensbidrag
Förlag
Springer
Ämne
- Computer Science
Nyckelord
- sweep-line method
- running time
- asymptotic upper bounds
- spanning tree
- time probability
- monotone circuits
- combinatorial algorithm
- subcubic approximation
- hidden constants
- arithmetic (0 - 1)-matrix multiplication
- subcubic algorithms
- input matrices
- entry witness
- Boolean product
- data structure
- Boolean matrices
- rectilinear region
- rectangles
- minimum number
- geometric approach
- Boolean matrix multiplication
Conference name
Algorithms and Computation. 13th International Symposium, ISSAC 2002.
Conference date
2002-11-21 - 2002-11-23
Conference place
Vancouver, BC, Canada
Status
Published
ISBN/ISSN/Övrigt
- ISSN: 1611-3349
- ISSN: 0302-9743