相关论文: Renormalization group approach to satisfiability

The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…

The functional renormalisation group equation is derived in a mathematically rigorous fashion in a framework suitable for the Osterwalder-Schrader formulation of quantum field theory. To this end, we devise a very general regularisation…

Connecting orbits are important invariant structures in the state space of nonlinear systems and various techniques are designed for their computation. However, a uniform analytic approximation of the whole orbit seems rare. Here, based on…

Random instances of Constraint Satisfaction Problems (CSP's) appear to be hard for all known algorithms, when the number of constraints per variable lies in a certain interval. Contributing to the general understanding of the structure of…

A recently introduced real space renormalization group technique, developed for the analysis of processes in the Kardar-Parisi-Zhang universality class, is generalized and tested by applying it to a different family of surface growth…

We illustrate how to extend the concept of structural stability through applying it to the front propagation speed selection problem. This consideration leads us to a renormalization group study of the problem. The study illustrates two…

We discuss an environmentally friendly renormalization group approach to analyze phase transitions. We intend to apply this method to the Electroweak Phase Transition. This work is in progress. We present some previously obtained results…

Batch normalization has been widely used to improve optimization in deep neural networks. While the uncertainty in batch statistics can act as a regularizer, using these dataset statistics specific to the training set impairs generalization…

It is argued that universality is severely limited for models with multiple fixed points. As a demonstration the renormalization group equations are presented for the potential and the wave function renormalization constants in the $O(N)$…

According to the available publications, the field theoretical renormalization group (RG) approach in the two-dimensional case gives the critical exponents that differ from the known exact values. This fact was attempted to explain by the…

In these proceedings, we discuss why functional renormalization is an essential tool to treat strongly disordered systems. More specifically, we treat elastic manifolds in a disordered environment. These are governed by a disorder…

Group and individual solutions are considered for hard problems such as satisfiability problem. Time-space trade-off in a structured active memory provides means to achieve lower time complexity for solutions of these problems.

Phase transitions in combinatorial problems have recently been shown to be useful in locating "hard" instances of combinatorial problems. The connection between computational complexity and the existence of phase transitions has been…

Various formulations of the exact renormalization group can be compared in the perturbative domain, in which we have reliable expressions for regularization-independent (universal) quantities. We consider the renormalization of the…

I show how a renormalization group (RG) method can be used to incrementally integrate the information in cosmological large-scale structure data sets (including CMB, galaxy redshift surveys, etc.). I show numerical tests for Gaussian…

Satisfiability solvers are increasingly playing a key role in software verification, with particularly effective use in the analysis of security vulnerabilities. String processing is a key part of many software applications, such as…

We use the reconfiguration framework to analyze problems that involve the rearrangement of items among groups. In various applications, a group of items could correspond to the files or jobs assigned to a particular machine, and the goal of…

The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in polynomial time for nilpotent groups while it is NP-complete for…

Within the exact renormalisation group approach, it is shown that stability properties of the flow are controlled by the choice for the regulator. Equally, the convergence of the flow is enhanced for specific optimised choices for the…

A renormalization group method with the Lie symmetry is presented for the singular perturbation problems. Asymptotic solutions are obtained as group-invariant solutions under approximate Lie group admitted by perturbed differential…