Skip to search formSkip to main contentSkip to account menu

Complexity of constraint satisfaction

The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been… 
Wikipedia (opens in a new tab)

Related topics

Related topics

20 relations
Binary constraintComputational complexity theoryConstraint satisfactionConstraint satisfaction problem

Broader (1)

Constraint programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Hybrid (V)CSPs and algebraic reductions
Constraint Satisfaction Problem (CSP) can be stated as computing a homomorphism $\mbox{$\bR \rightarrow \bGamma$}$ between two… 
2014
2014
A new CSP graph-based representation to resource-constrained project scheduling problem
Resource-Constrained Project Scheduling Problem (RCPSP) is a NP-hard combinatorial problem that consists in scheduling different… 
2013
2013
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes
We prove improved inapproximability results for hypergraph coloring using the low-degree polynomial code (aka, the"short code" of… 
2012
2012
Left Branch Extraction in Fragment and Truncated Cleft Constructions of Korean
This paper investigates into fragment and truncated cleft (or subjectless copular verb clause) constructions in Korean by… 
2009
2009
Synchronization and Cancelation in Workflows Based on Reset Nets
Workflow languages offer constructs for coordinating tasks. Among these constructs are various types of splits and joins. One… 
Review
2007
Review
2007
Computational Complexity of Constraint Satisfaction
The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between… 
2007
2007
Complexity results for boolean constraint satisfaction problems
My thesis is concerned with Boolean constraint satisfaction problems (CSP). A constraint consists of a set of variables and a… 
2005
2005
Spécifications modales de réseaux de Petri
We present an extension of Badouel & Darondeau's results for unlabeled Petri net synthesis from regular languages. We study… 
2004
2004
Convolutional Factor Graphs as Probabilistic Models
Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs… 
1994
1994
The complexity of constraint satisfaction revisited
This paper is a retrospective account of some of the developments leading up to, and ensuing from, the analysis of the complexity… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)