All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables

Gregory Gutin; Leo van Iersel; Matthias Mnich; Anders Yeo

doi:10.1007/978-3-642-15775-2_28

ScienceGate Book Chapters

BOOK-CHAPTER

All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables

Gregory Gutin Leo van Iersel Matthias Mnich Anders Yeo

Year: 2010 Lecture notes in computer science Pages: 326-337 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-642-15775-2_28

Get Full-Text PDF Get Analytical Report

Keywords:

Multiset Parameterized complexity Permutation (music) Ternary operation Mathematics Combinatorics Constraint satisfaction problem Cyclic permutation Quadratic equation Set (abstract data type) Permutation group Discrete mathematics Symmetric group Computer science Statistics

Metrics

Cited By

7.53

FWCI (Field Weighted Citation Impact)

Refs

0.98

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Constraint Satisfaction and Optimization

Physical Sciences → Computer Science → Computer Networks and Communications

All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables

Metrics

Citation History

Topics

Related Documents

Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables

Kernelization, Constraint Satisfaction Problems Parameterized above Average

Kernelization: Constraint Satisfaction Problems Parameterized Above Average

Improved Parameterized Algorithms for above Average Constraint Satisfaction

Kernelization, Permutation CSPs Parameterized above Average