"Every ternary permutation constraint satisfaction problem parameterized ..."

Gregory Z. Gutin et al. (2012)

> Home

Details and statistics

DOI: 10.1016/J.JCSS.2011.01.004

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/GutinIMY12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/GutinIMY12
Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo:
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables. J. Comput. Syst. Sci. 78(1): 151-163 (2012)

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.