Renormalization group approach to satisfiability
Renormalization group approach to satisfiability
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 ORs of these variables is true. Here, a renormalization group transformation is …