Pages that link to "Item:Q3304119"
From MaRDI portal
The following pages link to Lower bounds for combinatorial algorithms for Boolean matrix multiplication (Q3304119):
Displaying 6 items.
- An improved combinatorial algorithm for Boolean matrix multiplication (Q1640996) (← links)
- A Note on Deterministic Poly-Time Algorithms for Partition Functions Associated with Boolean Matrices with Prescribed Row and Column Sums (Q2849938) (← links)
- Regularity lemmas and combinatorial algorithms (Q2913804) (← links)
- Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication (Q2969654) (← links)
- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices (Q5041266) (← links)
- Trans-dichotomous algorithms without multiplication — some upper and lower bounds (Q5096958) (← links)