Constraint Satisfaction Problems with Advice
arXiv:2403.02212v1 [cs.DS] 4 Mar 2024 Page 1 arXiv:2403.02212v1 [cs.DS] 4 Mar 2024
Constraint Satisfaction Problems with Advice Suprovat Ghoshal Northwestern and TTIC …
Constraint Satisfaction Problems with Advice Suprovat Ghoshal Northwestern and TTIC …
The Complexity of Promise Constraint Satisfaction Problem Seen from the Other Side
We introduce the framework of the left-hand side restricted promise constraint satisfaction
problem, which includes problems like approximating clique number of a graph. We study …
problem, which includes problems like approximating clique number of a graph. We study …
[PDF][PDF] Approximate constraint satisfaction
L Engebretsen - 2000 - diva-portal.org
In this thesis we study optimization versions of NP-complete constraint satisfaction problems.
An example of such a problem is the Maximum Satisfiability problem. An instance of this …
An example of such a problem is the Maximum Satisfiability problem. An instance of this …
Constraint satisfaction problems parameterized above or below tight bounds: A survey
We consider constraint satisfaction problems parameterized above or below tight bounds.
One example is MaxSat parameterized above m/2: given a CNF formula F with m clauses …
One example is MaxSat parameterized above m/2: given a CNF formula F with m clauses …
A new approach for weighted constraint satisfaction
HC Lau - Constraints, 2002 - Springer
Abstract We consider the Weighted Constraint Satisfaction Problem which is an important
problem in Artificial Intelligence. Given a set of variables, their domains and a set of …
problem in Artificial Intelligence. Given a set of variables, their domains and a set of …
On the efficient approximability of constraint
J Håstad - Surveys in combinatorics 2007, 2007 - books.google.com
On the efficient approximability of constraint Page 210 On the efficient approximability of
constraint 1 satisfaction problems Johan Håstad Abstract We discuss some results about the …
constraint 1 satisfaction problems Johan Håstad Abstract We discuss some results about the …
The structure of tractable constraint satisfaction problems
M Grohe - Mathematical Foundations of Computer Science 2006 …, 2006 - Springer
LNCS 4162 - The Structure of Tractable Constraint Satisfaction Problems Page 1 The Structure
of Tractable Constraint Satisfaction Problems Martin Grohe Institut für Informatik, Humboldt …
of Tractable Constraint Satisfaction Problems Martin Grohe Institut für Informatik, Humboldt …
[PDF][PDF] The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation.
This work aims towards the automatic generation of advice to guide the solution of difficult
constraintsatisfaction problems (CSPs). The advice is generated by consulting relaxed, easy …
constraintsatisfaction problems (CSPs). The advice is generated by consulting relaxed, easy …
[HTML][HTML] Guarantees and limits of preprocessing in constraint satisfaction and reasoning
We present a first theoretical analysis of the power of polynomial-time preprocessing for
important combinatorial problems from various areas in AI. We consider problems from …
important combinatorial problems from various areas in AI. We consider problems from …