Related papers: Renormalization group approach to satisfiability
Anti-unification in logic programming refers to the process of capturing common syntactic structure among given goals, computing a single new goal that is more general called a generalization of the given goals. Finding an arbitrary common…
We prove that the functional renormalization group flow equation admits a perturbative solution and show explicitly the scheme transformation that relates it to the standard schemes of perturbation theory. We then define a universal scheme…
The result from developing and applying the notions of functional self-similarity and the Bogoliubov renormalization group to boundary-value problems in mathematical physics during the last decade are reviewed. The main achievement is the…
We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…
The generalized phase retrieval problem over compact groups aims to recover a set of matrices -- representing an unknown signal -- from their associated Gram matrices. This framework generalizes the classical phase retrieval problem, which…
We study a simple and exactly solvable model for the generation of random satisfiability problems. These consist of $\gamma N$ random boolean constraints which are to be satisfied simultaneously by $N$ logical variables. In…
In this paper I argue that infinities in the classical computation theory such as the unsolvability of the Halting Problem can be addressed in the same way as Feynman divergences in Quantum Field Theory, and that meaningful versions of…
The exact or Wilson renormalization group equations can be formulated as a functional Fokker-Planck equation in the infinite-dimensional configuration space of a field theory, suggesting a stochastic process in the space of couplings.…
The k-satisfiability problem is a well-known task in computational complexity theory. In this paper approach for it's solving is introduced.
Methods for the reduction of the complexity of computational problems are presented, as well as their connections to renormalization, scaling, and irreversible statistical mechanics. Several statistically stationary cases are analyzed; for…
Renormalization group procedure for effective particles in the front form of Hamiltonian dynamics is applied to an elementary quantum field theory for two species of particles mixed through a mass-like interaction term. The model…
A recently proposed renormalization group technique, based on the hierarchical structures present in theories with fluctuating geometry, is implemented in the model of branched polymers. The renormalization group equations can be solved…
We study the satisfiability problem of symbolic finite automata and decompose it into the satisfiability problem of the theory of the input characters and the monadic second-order theory of the indices of accepted words. We use our…
The renormalization group is used to improve the effective potential of massive ${\rm O}(N)$ symmetric $\phi^4$ theory. Explicit results are given at the two-loop level.
This paper investigates the reconfiguration variant of the Constraint Satisfaction Problem (CSP), referred to as the Reconfiguration CSP (RCSP). Given a CSP instance and two of its solutions, RCSP asks whether one solution can be…
We formulate the standard real-space renormalization group method in a way which takes into account the correlation between blocks. This is achieved in a dynamical way by means of operators which reflect the influence on a given block of…
Theoretical complexity is a vital subfield of computer science that enables us to mathematically investigate computation and answer many interesting queries about the nature of computational problems. It provides theoretical tools to assess…
We apply the functional renormalization group theory to the dynamics of first-order phase transitions and show that a potential with all odd-order terms can describe spinodal decomposition phenomena. We derive a momentum-dependent dynamic…
In resolving instances of a computational problem, if multiple instances of interest share a feature in common, it may be fruitful to compile this feature into a format that allows for more efficient resolution, even if the compilation is…
Similarity renormalization group procedure identifies the role of bound states in the low-energy rate of change of effective coupling constant in a model Hamiltonian with asymptotic freedom.