Fast practical algorithms for the Boolean-product-witness-matrix problem

DOI10.1145/345542.345611MaRDI QIDQ3454755zbMATH OpenOpenAlexFDO

Authors Anshul Gupta, Pankaj Rohatgi, Ramesh C. Agarwal

Publication date 26 November 2015

Published in Proceedings of the 2000 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/345542.345611

Mathematics Subject Classification ID

Boolean and Hadamard matrices (15B34) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
• A fast output-sensitive algorithm for Boolean matrix multiplication
• On minimum witnesses for Boolean matrix multiplication
• scientific article; zbMATH DE number 1830739
• scientific article; zbMATH DE number 1979525

Cited in

(8)

• An improved algorithm for Boolean matrix multiplication
• Witnesses for Boolean matrix multiplication and for transitive closure
• Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication
• A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
• scientific article; zbMATH DE number 1830739 (Why is no real title available?)
• On minimum witnesses for Boolean matrix multiplication
• Probabilistic tensors and opportunistic Boolean matrix multiplication
• A fast output-sensitive algorithm for Boolean matrix multiplication

This page was built for publication: Fast practical algorithms for the Boolean-product-witness-matrix problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454755)