An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem (Q1698703)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An O(n^2 m)-time algorithm for the boxed-mesh permutation pattern matching problem |
scientific article; zbMATH DE number 6839795
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem |
scientific article; zbMATH DE number 6839795 |
Statements
An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem (English)
0 references
16 February 2018
0 references
permutation pattern matching
0 references
order-isomorphism
0 references
boxed-mesh pattern
0 references
0 references
0.9142091274261476
0 references
0.8650199770927429
0 references
0.7555075287818909
0 references
0.7451539039611816
0 references
