Related papers: Statistical Mechanics of an NP-complete Problem: S…
The partition of graphs into "nice" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size stars, a problem known to be NP-complete even for the case of…
It is shown that the statistical conception of quantum mechanics is dynamical but not probabilistic, i.e. the statistical description in quantum mechanics is founded on dynamics. A use of the probability theory, when it takes place, is…
We revisit the problem of condensation for independent, identically distributed random variables with a power-law tail, conditioned by the value of their sum. For large values of the sum, and for a large number of summands, a condensation…
In this paper we introduce the concept of completeness of sets. We study this property on the set of integers. We examine how this property is preserved as we carry out various operations compatible with sets. We also introduce the problem…
In this paper, we explore statistical versus computational trade-off to address a basic question in the application of a distributed algorithm: what is the minimal computational cost in obtaining statistical optimality? In smoothing spline…
In this paper, we prove that the numerical-semigroup-gap counting problem is #NP-complete as a main theorem. A numerical semigroup is an additive semigroup over the set of all nonnegative integers. A gap of a numerical semigroup is defined…
An approach to the solution of NP-complete problems based on quantum computing and chaotic dynamics is proposed. We consider the satisfiability problem and argue that the problem, in principle, can be solved in polynomial time if we combine…
Approximating Subset Sum is a classic and fundamental problem in computer science and mathematical optimization. The state-of-the-art approximation scheme for Subset Sum computes a $(1-\varepsilon)$-approximation in time…
The aim of this review is to provide a concise overview of some of the generic approaches that have been developed to deal with the statistical description of large systems of interacting dissipative 'units'. The latter notion includes,…
Despite remarkable achievements in its practical tractability, the notorious class of NP-complete problems has been escaping all attempts to find a worst-case polynomial time-bound solution algorithms for any of them. The vast majority of…
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization". In this paper we introduce and explore a novel but general form of parameterization: the number of…
The reviewed paper describes an analog device that empirically solves small instances of the NP-complete Subset Sum Problem (SSP). The authors claim that this device can solve the SSP in polynomial time using polynomial space, in principle,…
I give a highly selective overview of the way statistical mechanics explains the microscopic origins of the time asymmetric evolution of macroscopic systems towards equilibrium and of first order phase transitions in equilibrium. These…
In a recent paper (Tran et al., Ann.Phys.311(2004)204), some asymptotic number theoretical results on the partitioning of an integer were derived exploiting its connection to the quantum density of states of a many-particle system. We…
I give a concise introduction to some essential concepts of statistical mechanics: 1. Probability theory (constrained distributions, concentration theorem, frequency estimation, hypothesis testing); 2. Macroscopic systems in equilibrium…
We review the statistical mechanics approach to the study of the emerging collective behavior of systems of heterogeneous interacting agents. The general framework is presented through examples is such contexts as ecosystem dynamics and…
An unified thermodynamical framework based in the use of a generalized Massieu-Planck thermodynamic potential is proposed and a new formulation of Boltzmann-Gibbs Statistical Mechanics is established. Under this philosophy a generalization…
We use a semiclassical approximation to derive the partition function for an arbitrary potential in one-dimensional Quantum Statistical Mechanics, which we view as an example of finite temperature scalar Field Theory at a point. We rely on…
Variational-hemivariational inequalities are an area full of interesting and challenging mathematical problems. The area can be viewed as a natural extension of that of variational inequalities. Variational-hemivariational inequalities are…
Optimization under uncertainty deals with the problem of optimizing stochastic cost functions given some partial information on their inputs. These problems are extremely difficult to solve and yet pervade all areas of technological and…