Volume 77, Number 3, February 2007
|Number of page(s)||4|
|Published online||02 February 2007|
Renormalization group approach to satisfiability
Department of Physics, University of Wisconsin - 1150 University Avenue, Madison, WI 53706, USA
Accepted: 11 December 2006
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 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.
PACS: 05.10.Cc – Renormalization group methods / 89.20 Ff – Computer science and technology / 75.10.Nr – Spin-glass and other random models
© Europhysics Letters Association, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.