דקל צור

The most efficient currently known algorithms for two-dimensional pattern matching with rotations have a worst case time complexity of O (n² m³), 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 (n² m²).