„Boolean matrix multiplication“

Suchergebnisse

11 Treffer

• All-Pairs 2-Reachability in O(n^w log n) Time
  Georgiadis, Loukas ; Graf, Daniel ; Italiano, Giuseppe F. ; Parotsidis, Nikos ; Uznanski, Przemyslaw 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Longest Common Extensions with Wildcards: Trade-Off and Applications
  Bathie, Gabriel ; Charalampopoulos, Panagiotis ; Starikovskaya, Tatiana 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication
  Harris, David G. 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Functional Lower Bounds for Restricted Arithmetic Circuits of Depth Four
  Chillara, Suryajith 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication
  Das, Debarati ; Koucký, Michal ; Saks, Michael 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication
  Fu, Hu ; Kleinberg, Robert 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An improved algorithm for Boolean matrix multiplication
  Santoro, N. ; Urrutia, J.
• Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
  Alon, N. ; Naor, M.
• Improved time and space bounds for Boolean matrix multiplication
  Adleman, Leonard ; Booth, Kellogg S. ; Preparata, Franco P. ; Ruzzo, Walter L.
• Constant Time Boolean Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System
  Li, Keqin
• Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
  Jeffery, Stacey ; Kothari, Robin ; Le Gall, François ; Magniez, Frédéric