Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices (Q5041266)
From MaRDI portal
scientific article; zbMATH DE number 7601076
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices |
scientific article; zbMATH DE number 7601076 |
Statements
Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices (English)
0 references
13 October 2022
0 references
Boolean matrix
0 references
submatrices
0 references
two-dimensional pattern matching
0 references
local picture language
0 references
triangle finding-hard problem
0 references
fast matrix multiplication
0 references
