PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

There are no pure relational widht 2 problems
Victor Dalmau
Information Processing Letters 2009.

Abstract

n this note, we show that every constraint satisfaction problem that has relational width 2 has also relational width 1. This is achieved by means of an obstruction-like characterization of relational width which we believe to be of independent interest.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:5287
Deposited By:Victor Dalmau
Deposited On:24 March 2009

[Edit]