"Diverse Palindromic Factorization Is NP-complete."

Hideo Bannai et al. (2015)

> Home

Details and statistics

DOI: 10.1007/978-3-319-21500-6_6

access: closed

type: Conference or Workshop Paper

metadata version: 2021-07-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/dlt/BannaiGIKKPPS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dlt/BannaiGIKKPPS15
Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto:
Diverse Palindromic Factorization Is NP-complete. DLT 2015: 85-96

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.