The most efficient currently known algorithms for two-dimensional pattern matching with rotations have a worst case time complexity of O (n2 m3), where the size of the text is n × n and the size of the pattern is m × m. In this paper we present a new algorithm for the problem whose running time is O (n2 m2). © 2006.
Amir, A., Kapah, O., & Tsur, D. (2006). Faster two-dimensional pattern matching with rotations. Theoretical Computer Science, 368(3), 196–204. https://doi.org/10.1016/j.tcs.2006.09.012