An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem
From MaRDI portal
(Redirected from An O(n^2 m)-time algorithm for the boxed-mesh permutation pattern matching problem)
An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem
An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
