Phase Transition of Tractability in Constraint Satisfaction and Bayesian Network Inference

10/19/2012
by   Yong Gao, et al.
0

There has been great interest in identifying tractable subclasses of NP complete problems and designing efficient algorithms for these tractable classes. Constraint satisfaction and Bayesian network inference are two examples of such problems that are of great importance in AI and algorithms. In this paper we study, under the frameworks of random constraint satisfaction problems and random Bayesian networks, a typical tractable subclass characterized by the treewidth of the problems. We show that the property of having a bounded treewidth for CSPs and Bayesian network inference problem has a phase transition that occurs while the underlying structures of problems are still sparse. This implies that algorithms making use of treewidth based structural knowledge only work efficiently in a limited range of random instance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/26/2018

The replica symmetric phase of random constraint satisfaction problems

Random constraint satisfaction problems play an important role in comput...
research
10/09/2017

The complexity of general-valued CSPs seen from the other side

General-valued constraint satisfaction problems (VCSPs) are generalisati...
research
10/10/2011

Consistency and Random Constraint Satisfaction Models

In this paper, we study the possibility of designing non-trivial random ...
research
07/03/2021

Solving Infinite-Domain CSPs Using the Patchwork Property

The constraint satisfaction problem (CSP) has important applications in ...
research
07/20/2020

Biased measures for random Constraint Satisfaction Problems: larger interaction range and asymptotic expansion

We investigate the clustering transition undergone by an exemplary rando...
research
03/06/2019

Proving the NP-completeness of optimal moral graph triangulation

Moral graphs were introduced in the 1980s as an intermediate step when t...
research
09/23/2022

The cavity method: from exact solutions to algorithms

The goal of this chapter is to review the main ideas that underlie the c...

Please sign up or login with your details

Forgot password? Click here to reset