Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,301 papers from all fields of science
Search
Sign In
Create Free Account
Complexity of constraint satisfaction
The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
20 relations
Binary constraint
Computational complexity theory
Constraint satisfaction
Constraint satisfaction problem
Expand
Broader (1)
Constraint programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
A new CSP graph-based representation to resource-constrained project scheduling problem
A. González-Pardo
,
David Camacho
IEEE Congress on Evolutionary Computation
2014
Corpus ID: 8645292
Resource-Constrained Project Scheduling Problem (RCPSP) is a NP-hard combinatorial problem that consists in scheduling different…
Expand
2013
2013
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes
V. Guruswami
,
P. Harsha
,
J. Håstad
,
S. Srinivasan
,
G. Varma
Symposium on the Theory of Computing
2013
Corpus ID: 456586
We prove improved inapproximability results for hypergraph coloring using the low-degree polynomial code (aka, the"short code" of…
Expand
2010
2010
Estimation of 3D Protein Structure by means of parallel Particle Swarm Optimization
Luis Germán Pérez-Hernández
,
K. Rodríguez-Vázquez
,
R. Garduño-Juárez
IEEE Congress on Evolutionary Computation
2010
Corpus ID: 21657360
This paper presents the Algorithm of Particle Swarm Optimization (PSO) implemented in a Distributed Computing Environment. The…
Expand
Review
2007
Review
2007
Computational Complexity of Constraint Satisfaction
H. Vollmer
Conference on Computability in Europe
2007
Corpus ID: 14572050
The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between…
Expand
2007
2007
On structurally constrained H/sub 2/ performance bounds for stable MIMO plant models
Eduardo I. Silva
,
D. Oyarzún
,
M. Salgado
2007
Corpus ID: 113398309
This paper discusses optimal control problems in which the controller must satisfy sparsity structure constraints. Conditions are…
Expand
2003
2003
A New Classs of Binary CSPs for which Arc-Constistency Is a Decision Procedure
D. Cohen
International Conference on Principles and…
2003
Corpus ID: 29696537
In this report we introduce a new hybrid class for which arc-consistency is a decision procedure. This new hybrid class…
Expand
2002
2002
The resolution complexity of constraint satisfaction
D. Mitchell
2002
Corpus ID: 115958967
Constraint satisfaction provides a uniform framework for addressing a variety of combinatorial problems. Propositional proof…
Expand
1995
1995
Information Hiding and the Complexity of Constraint Satisfaction
R. Veltkamp
,
R.H.M.C. Kelleners
Eurographics Workshop on Programming Paradigms in…
1995
Corpus ID: 778642
This paper discusses the complexity of constraint satisfaction, and the effect of information hiding. On the one hand, powerful…
Expand
1994
1994
The complexity of constraint satisfaction revisited
D. Bobrow
1994
Corpus ID: 126194091
This paper is a retrospective account of some of the developments leading up to, and ensuing from, the analysis of the complexity…
Expand
1990
1990
The Complexity of Constraint Satisfaction in Prolog
Bernard A. Nadel
AAAI Conference on Artificial Intelligence
1990
Corpus ID: 28736509
We obtain here the complexity of solving a type of Prolog problem which Genesereth and Nilsson have called sequential constraint…
Expand
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)
ACCEPT & CONTINUE