Related papers: Fast optimization algorithms and the cosmological …
We introduce a dynamical model to reduce a large cosmological constant to a sufficiently small value. The basic ingredient in this model is a distinction which has been made between the two unit systems used in cosmology and particle…
The minimisation of cost functions is crucial in various optimisation fields. However, identifying their global minimum remains challenging owing to the huge computational cost incurred. This work analytically expresses the computational…
We have recently constructed a manifestly local formulation of a nonlocal approach to the cosmological constant problem which can treat with quantum effects from both matter and gravitational fields. In this formulation, it has been…
The joint optimization of the integer matrix $\mathbf{A}$ and the power scaling matrix $\mathbf{D}$ is central to achieving the capacity-approaching performance of Integer-Forcing (IF) precoding. This problem, however, is known to be…
The standard formulation of the cosmological constant problem is based on one critical assumption---the spacetime is homogeneous and isotropic, which is true only on cosmological scales. However, this problem is caused by extremely small…
Accelerating universe or the existence of a small and positive cosmological constant is probably the most pressing obstacle as well as opportunity to significantly improving the models of four-dimensional cosmology from fundamental theories…
Recent decades, the emergence of numerous novel algorithms makes it a gimmick to propose an intelligent optimization system based on metaphor, and hinders researchers from exploring the essence of search behavior in algorithms. However, it…
We propose a new approach for multiverse analysis based on computational complexity, which leads to a new family of "computational" measure factors. By defining a cosmology as a space-time containing a vacuum with specified properties (for…
We study the role of the cosmological constant (CC) as a component of dark energy (DE). It is argued that the cosmological term is in general unavoidable and it should not be ignored even when dynamical DE sources are considered. From the…
An overview of some methods of statistical physics applied to the analysis of algorithms for optimization problems (satisfiability of Boolean constraints, vertex cover of graphs, decoding, ...) with distributions of random inputs is…
It is possible that there may be differences in the fundamental physical parameters from one side of the observed universe to the other. I show that the cosmological constant is likely to be the most sensitive of the physical parameters to…
Many problems are NP-hard and, unless P = NP, do not admit polynomial-time exact algorithms. The fastest known exact algorithms exactly usually take time exponential in the input size. Much research effort has gone into obtaining faster…
We discuss the cosmological constant problem in the context of higher codimension brane world scenarios with infinite-volume extra dimensions. In particular, by adding higher curvature terms in the bulk action we are able to find smooth…
A finite quantum gravity theory is used to resolve the cosmological constant problem. A fundamental quantum gravity scale, \Lambda_G \leq 10^{-3} eV, is introduced above which the quantum corrections to the vacuum energy density coupled to…
What is the effectiveness of local search algorithms for geometric problems in the plane? We prove that local search with neighborhoods of magnitude $1/\epsilon^c$ is an approximation scheme for the following problems in the Euclidian…
We examine a simple theoretical model to estimate (by fine tuning condition) the value of the cosmological constant. We assume, in analogy with holographic principle, that cosmological constant, like classical surface tension coefficient in…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
Different spatial objects that vary in their characteristics, such as molecular biology and geography, are presented in spatial areas. Methods to organize, manage, and maintain those objects in a structured manner are required. Data mining…
In this thesis, we settle the computational complexity of some fundamental questions in polynomial optimization. These include the questions of (i) finding a local minimum, (ii) testing local minimality of a point, and (iii) deciding…