"The Complexity of the Minimum k-Cover Problem."

Richard Cole et al. (2005)

> Home

Details and statistics

DOI: 10.25596/JALC-2005-641

access: closed

type: Journal Article

metadata version: 2021-06-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jalc/ColeIMSY05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jalc/ColeIMSY05
Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang:
The Complexity of the Minimum k-Cover Problem. J. Autom. Lang. Comb. 10(5/6): 641-653 (2005)

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.