"A Completeness Theory for Polynomial (Turing) Kernelization."

Danny Hermelin et al. (2015)

> Home

Details and statistics

DOI: 10.1007/S00453-014-9910-8

access: closed

type: Journal Article

metadata version: 2019-10-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/HermelinKSWW15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/HermelinKSWW15
Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu:
A Completeness Theory for Polynomial (Turing) Kernelization. Algorithmica 71(3): 702-730 (2015)

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.