Faster Exponential Algorithm for Permutation Pattern Matching

08/25/2021
by   Paweł Gawrychowski, et al.
0

The Permutation Pattern Matching problem asks, given two permutations σ on n elements and π, whether σ admits a subsequence with the same relative order as π (or, in the counting version, how many such subsequences are there). This natural problem was shown by Bose, Buss and Lubiw [IPL 1998] to be NP-complete, and hence we should seek exact exponential time solutions. The asymptotically fastest such solution up to date, by Berendsohn, Kozma and Marx [IPEC 2019], works in 𝒪(1.6181^n) time. We design a simple and faster 𝒪(1.415^n) time algorithm for both the detection and the counting version. We also prove that this is optimal among a certain natural class of algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/12/2020

Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH

In this paper, we seek a natural problem and a natural distribution of i...
research
02/28/2022

MaxCut on Permutation Graphs is NP-complete

In this paper, we prove that the MaxCut problem is NP-complete on permut...
research
08/11/2020

A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes

Permutation Pattern Matching (PPM) is the problem of deciding for a give...
research
09/29/2021

Ruler Wrapping

We propose a natural variation of the Hopcroft, Joseph and Whitesides' (...
research
07/22/2021

Griddings of permutations and hardness of pattern matching

We study the complexity of the decision problem known as Permutation Pat...
research
10/01/2020

Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs

Permutation σ appears in permutation π if there exists a subsequence of ...
research
11/04/2019

Counting Small Permutation Patterns

A sample of n generic points in the xy-plane defines a permutation that ...

Please sign up or login with your details

Forgot password? Click here to reset