"Parameterized Complexity and Kernel Bounds for Hard Planning Problems."

Christer Bäckström et al. (2013)

> Home

Details and statistics

DOI: 10.1007/978-3-642-38233-8_2

access: closed

type: Conference or Workshop Paper

metadata version: 2024-08-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ciac/BackstromJOS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ciac/BackstromJOS13
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
Parameterized Complexity and Kernel Bounds for Hard Planning Problems. CIAC 2013: 13-24

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.