Renormalization group approach to satisfiability

Details Renormalization group approach to satisfiability Renormalization group approach to satisfiability

2005-09-06

arxiv.org/abs/cond-mat/0509160v2

Physics

Condensed Matter

Statistical Mechanics

4 pages, 2 figures

Scientific paper

Satisfiability is a classic problem in computational complexity theory, in which one wishes to determine whether an assignment of values to a collection of Boolean variables exists in which all of a collection of clauses composed of logical OR's of these variables is true. Here, a renormalization group transformation is constructed and used to relate the properties of satisfiability problems with different numbers of variables in each clause. The transformation yields new insight into phase transitions delineating "hard" and "easy" satisfiability problems.

Affiliated with

Also associated with

No associations

Rating

Renormalization group approach to satisfiability 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 Renormalization group approach to satisfiability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Renormalization group approach to satisfiability will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-216620