Hardness of permutation pattern matching

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10330722" target="_blank" >RIV/00216208:11320/17:10330722 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1137/1.9781611974782.24" target="_blank" >http://dx.doi.org/10.1137/1.9781611974782.24</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1137/1.9781611974782.24" target="_blank" >10.1137/1.9781611974782.24</a>

Result language

angličtina

Original language name

Hardness of permutation pattern matching

Original language description

We show that permutation pattern matching of a permutation pi in a permutation tau is NP-complete even when pi has no decreasing subsequence of length 3 and tau has no decreasing subsequence of length 4. We also show that this hardness result is tight.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GJ16-01602Y" target="_blank" >GJ16-01602Y: Topological and geometric approaches to classes of permutations and graph properties</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2017

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms

ISBN

978-1-61197-478-2

ISSN

—

e-ISSN

neuvedeno

Number of pages

19

Pages from-to

378-396

Publisher name

ACM-SIAM

Place of publication

Neuveden

Event location

Barcelona

Event date

Jan 16, 2017

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—