Related papers: Computational complexity of the avalanche problem …
NP complete problem is one of the most challenging issues. The question of whether all problems in NP are also in P is generally considered one of the most important open questions in mathematics and theoretical computer science as it has…
We consider the Abelian sandpile model on triangular and hexagonal lattices. We compute several height probabilities on the full plane and on half-planes, and discuss some properties of the universality of the model.
The aim of this study is to investigate a wave dynamics and size scaling of avalanches which were created by the mathematical model {[}J. \v{C}ern\'ak Phys. Rev. E \textbf{65}, 046141 (2002)]. Numerical simulations were carried out on a two…
The Quadratic Assignment Problem (QAP) is a well-known NP-hard problem that is equivalent to optimizing a linear objective function over the QAP polytope. The QAP polytope with parameter $n$ - \qappolytope{n} - is defined as the convex hull…
We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for…
In this paper we introduce new various generalizations of the classical Kadomtsev-Petviashvili hierarchy in the case of operators in several variables. These generalizations are the candidates for systems that should play the role,…
For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms…
The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…
We revisit a classical problem in transportation, known as the continuous (bilevel) network design problem, CNDP for short. We are given a graph for which the latency of each edge depends on the ratio of the edge flow and the capacity…
We work in set-theory without choice ZF. Denoting by AC(N) the countable axiom of choice, we show in ZF+AC(N) that the closed unit ball of a uniformly convex Banach space is compact in the convex topology (an alternative to the weak…
We survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory. Our primary focus is on recent findings concerning the (un)provability of complexity…
In the well-known complexity class NP are combinatorial problems, whose optimization counterparts are important for many practical settings. These problems typically consider full knowledge about the input. In practical settings, however,…
We introduce a new quantity, average fitness, into the Bak-Sneppen evolution model. Through the new quantity, a different hierarchy of avalanches is observed. The gap equation, in terms of the average fitness, is presented to describe the…
In 1979 Valiant introduced the complexity class VNP of p-definable families of polynomials, he defined the reduction notion known as p-projection and he proved that the permanent polynomial and the Hamiltonian cycle polynomial are…
The degree of predictability of large avalanche events in the directed sandpile model is studied. A waiting time based prediction strategy which exploits the local anticorrelation of large events is discussed. With this strategy we show…
This thesis presents several aspects of the physics of disordered elastic systems and of the analytical methods used for their study. On one hand we will be interested in universal properties of avalanche processes in the statics and…
We study the high-dimensional properties of an invading front in a disordered medium with random pinning forces. We concentrate on interfaces described by bounded slope models belonging to the quenched KPZ universality class. We find a…
We consider multi-dimensional junction problems for first- and second-order pde with Kirchoff-type Neumann boundary conditions and we show that their generalized viscosity solutions are unique. It follows that any viscosity-type…
Complex systems, when poised near a critical point of a phase transition between order and disorder, exhibit a dynamics comprising a scale-free mixture of order and disorder which is universal, i.e. system-independent (1-5). It allows…
We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…