Constraint satisfaction with succinctly specified relations

Chen, Hubie and Grohe, M. (2006) Constraint satisfaction with succinctly specified relations. In: Creignou, N. and Kolaitis, P.G. and Vollmer, H. (eds.) Complexity of Constraints. Dagstuhl Seminar Proceedings 06401. Internationales Begegnungs- und Forschungszentrum fuer Informatik.

Full text not available from this repository.

Official URL: http://drops.dagstuhl.de/opus/volltexte/2006/802

Abstract

The general intractability of the constraint satisfaction problem has motivated the study of the complexity of restricted cases of this problem. Thus far, the literature has primarily considered the formulation of the CSP where constraint relations are given explicitly. We initiate the systematic study of CSP complexity with succinctly specified constraint relations.

Metadata

Item Type:	Book Section
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	09 Mar 2021 14:31
Last Modified:	09 Aug 2023 12:50
URI:	https://eprints.bbk.ac.uk/id/eprint/43334

Statistics

Archive Staff Only (login required)

Edit/View Item