Faster multi-witnesses for Boolean matrix multiplication
From MaRDI portal
Publication:976085
DOI10.1016/J.IPL.2008.10.012zbMATH Open1190.65073OpenAlexW1989420494MaRDI QIDQ976085FDOQ976085
Leszek Gąsieniec, Mirosław Kowaluk, Andrzej Lingas
Publication date: 16 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.10.012
Cites Work
- Title not available (Why is that?)
- Matrix multiplication via arithmetic progressions
- Fast rectangular matrix multiplication and applications
- Title not available (Why is that?)
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
- Rectangular matrix multiplication revisited
- Faster algorithms for finding lowest common ancestors in directed acyclic graphs
- Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication
- Fast Lowest Common Ancestor Computations in Dags
- Finding Witnesses by Peeling
Cited In (12)
- Finding Cliques in Social Networks: A New Distribution-Free Model
- Efficient algorithms for subgraph listing
- A fast deterministic detection of small pattern graphs in graphs without large cliques
- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products
- Rare siblings speed-up deterministic detection and counting of small pattern graphs
- Bounds and algorithms for graph trusses
- Extreme witnesses and their applications
- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products
- Detecting and enumerating small induced subgraphs in \(c\)-closed graphs
- Extreme Witnesses and Their Applications
- Title not available (Why is that?)
- A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques
This page was built for publication: Faster multi-witnesses for Boolean matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976085)
