Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices

Daniel Prusa, Michael Wehar. Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices. In Natasa Jonoska, Dmytro Savchuk, editors, Developments in Language Theory - 24th International Conference, DLT 2020, Tampa, FL, USA, May 11-15, 2020, Proceedings. Volume 12086 of Lecture Notes in Computer Science, pages 266-279, Springer, 2020. [doi]

Abstract

Abstract is missing.