"The Complexity of Finding SUBSEQ(A)."

Stephen A. Fenner, William I. Gasarch, Brian Postow (2009)

> Home

Details and statistics

DOI: 10.1007/S00224-008-9111-4

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/FennerGP09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/FennerGP09
Stephen A. Fenner, William I. Gasarch, Brian Postow:
The Complexity of Finding SUBSEQ(A). Theory Comput. Syst. 45(3): 577-612 (2009)

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.