"A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes."

Vít Jelínek, Michal Opler, Jakub Pekárek (2020)

> Home

Details and statistics

DOI: 10.4230/LIPICS.MFCS.2020.52

access: open

type: Conference or Workshop Paper

metadata version: 2021-07-25

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/mfcs/JelinekOP20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/JelinekOP20
Vít Jelínek, Michal Opler, Jakub Pekárek:
A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. MFCS 2020: 52:1-52:18

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.