Related papers: Renormalization group approach to satisfiability
We introduce two versions of a renormalization group scheme for the equal load sharing fiber bundle model. The renormalization group is based on formulating the fiber bundle model in the language of damage mechanics. A central concept is…
Optimization is fundamental in many areas of science, from computer science and information theory to engineering and statistical physics, as well as to biology or social sciences. It typically involves a large number of variables and a…
The renormalization group is a tool that allows one to obtain a reduced description of systems with many degrees of freedom while preserving the relevant features. In the case of quantum systems, in particular, one-dimensional systems…
A renormalization group transformation suitable for spin glass models and, more generally, for disordered models, is presented. The procedure is non-standard in both the nature of the additional interactions and the coarse graining…
Phase equations describing the evolution of large scale modulation of spatially periodic patterns in two dimensional systems are derived by employing the renormalization group method. A general formula for phase diffusion coefficients is…
The renormalization-group improved effective potential ---to leading-log and in the linear curvature approximation--- is constructed for ``finite'' theories in curved spacetime. It is not trivial and displays a quite interesting,…
The technique known as group averaging provides powerful machinery for the study of constrained systems. However, it is likely to be well defined only in a limited set of cases. Here, we investigate the possibility of using a `renormalized'…
Matrix models of 2D quantum gravity are either exactly solvable for matter of central charge $ c\leq 1, $ or not understood. It would be useful to devise an approximate scheme which would be reasonable for the known cases and could be…
The Random K-Satisfiability Problem, consisting in verifying the existence of an assignment of N Boolean variables that satisfy a set of M=alpha N random logical clauses containing K variables each, is studied using the replica symmetric…
An exact renormalization group equation is derived for the free energy of matrix models. The renormalization group equation turns out to be nonlinear for matrix models, as opposed to linear for vector models. An algorithm for determining…
In the modeling of complex biological systems, the use of power-law models (such as S-systems and GMA systems) often provides a remarkable accuracy over several orders of magnitude in concentrations, an unusually broad range not fully…
Quantum field theories require a cutoff to regulate divergences that result from local interactions, and yet physical results can not depend on the value of this cutoff. The renormalization group employs a transformation that changes the…
Various uses of the renormalization group are examined.
A new method, called the method of self-similar approximants, and its recent developments are described. The method is based on the ideas of renormalization group theory and optimal control theory. It allows for the effective extrapolation…
A Boolean constraint satisfaction instance is a conjunction of constraint applications, where the allowed constraints are drawn from a fixed set B of Boolean functions. We consider the problem of determining whether two given constraint…
After a brief presentation of the exact renormalization group equation, we illustrate how the field theoretical (perturbative) approach to critical phenomena takes place in the more general Wilson (nonperturbative) approach. Notions such as…
It is shown that the renormalization group method does not necessarily eliminate all secular terms in perturbation series to partial differential equations and a functional subspace of renormalizable secular solutions corresponds to a…
We generalize the concept of Borel resummability and renormalons to a quantum field theory with an arbitrary number of fields and couplings, starting from the known notion based on the running coupling constants. An approach to identify the…
Satisfiability modulo theory (SMT) consists in testing the satisfiability of first-order formulas over linear integer or real arithmetic, or other theories. In this survey, we explain the combination of propositional satisfiability and…
This paper depicts algorithms for solving the decision Boolean Satisfiability Problem. An extreme problem is formulated to analyze the complexity of algorithms and the complexity for solving it. A novel and easy reformulation as a lottery…