"Separating sets of strings by finding matching patterns is almost always hard."

Giuseppe Lancia, Luke Mathieson, Pablo Moscato (2017)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2016.12.018

access: closed

type: Journal Article

metadata version: 2020-12-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/LanciaMM17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/LanciaMM17
Giuseppe Lancia, Luke Mathieson, Pablo Moscato:
Separating sets of strings by finding matching patterns is almost always hard. Theor. Comput. Sci. 665: 73-86 (2017)

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.