Exact phase transition of backtrack-free search with implications on the power of greedy algorithms

Details Exact phase transition of backtrack-free search with implications on the power of greedy algorithms Exact phase transition of backtrack-free search with implications on the power of greedy algorithms

2008-11-19

arxiv.org/abs/0811.3055v1

Computer Science

Artificial Intelligence

Scientific paper

Backtracking is a basic strategy to solve constraint satisfaction problems (CSPs). A satisfiable CSP instance is backtrack-free if a solution can be found without encountering any dead-end during a backtracking search, implying that the instance is easy to solve. We prove an exact phase transition of backtrack-free search in some random CSPs, namely in Model RB and in Model RD. This is the first time an exact phase transition of backtrack-free search can be identified on some random CSPs. Our technical results also have interesting implications on the power of greedy algorithms, on the width of random hypergraphs and on the exact satisfiability threshold of random CSPs.

Affiliated with

Also associated with

No associations

Rating

Exact phase transition of backtrack-free search with implications on the power of greedy algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exact phase transition of backtrack-free search with implications on the power of greedy algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact phase transition of backtrack-free search with implications on the power of greedy algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-428984