Related papers: NP is contained in DTIME(n^O(log^{gamma}))
We construct an infinite number of exact time dependent soliton solutions, carrying non-trivial Hopf topological charges, in a 3+1 dimensional Lorentz invariant theory with target space S^2. The construction is based on an ansatz which…
Nicolas inequality we deal can be written as \begin{equation}\label{Nicineq} e^\gamma \log\log N_x < \dfrac{N_x}{\varphi(N_x)}\,, \end{equation} where $x\ge 2$, $N_x$ denotes the product of the primes less or equal than $x$, $\gamma$ is the…
We study $q$-SAT in the multistage model, focusing on the linear-time solvable 2-SAT. Herein, given a sequence of $q$-CNF fomulas and a non-negative integer $d$, the question is whether there is a sequence of satisfying truth assignments…
We consider the problem of evaluating certain exponential sums. These sums take the form $\sum_{x_1,...,x_n \in Z_N} e^{f(x_1,...,x_n) {2 \pi i / N}} $, where each x_i is summed over a ring Z_N, and f(x_1,...,x_n) is a multivariate…
A canonical formalism of the rank-three tensor model with the notion of local time is proposed. The consistency of the local time evolution is guaranteed by imposing that local Hamiltonians and the so(N) kinematical symmetry of the tensor…
In this paper, we provide a deterministic polynomial time algorithm that determines satisfiability of 3-SAT. The complexity analysis for the algorithm takes into account no efficiency and yet provides a low enough bound, that efficient…
The purpose of this letter is to investigate the time complexity consequences of the truncated Taylor series, known as Taylor Polynomials \cite{bakas2019taylor,Katsoprinakis2011,Nestoridis2011}. In particular, it is demonstrated that the…
This paper considers the question of P = NP in context of the polynomial time SAT algorithm. It posits proposition dependent on existence of conjectured problem that even where the algorithm is shown to solve SAT in polynomial time it…
Finding a quantum computing method to solve nondeterministic polynomial time (NP)-complete problems is currently of paramount importance in quantum information science. Here an experiment is presented to demonstrate the use of Rydberg atoms…
Complexified spacetime algebra is defined as the geometric (Clifford) algebra of spacetime with complex coefficients, isomorphic $\mathcal{G}_{1,4}$. By resorting to matrix representation by means of Dirac-Pauli gamma matrices, the paper…
In this paper, we propose Probabilistic discrete-time Projection Temporal Logic (PrPTL), which extends Projection Temporal Logic (PTL) with probability. To this end, some useful formulas are derived and some logic laws are given. Further,…
An exact invariant is derived for $n$-degree-of-freedom Hamiltonian systems with general time-dependent potentials. The invariant is worked out in two equivalent ways. In the first approach, we define a special {\it Ansatz\/} for the…
Let G be a finite group acting on {1,...,n}. For any C*-algebra A, this defines an action of \alpha of G on A^{\otimes n}. We show that if A tensorially absorbs a UHF algebra of infinite type, the Jiang-Su algebra, or is approximately…
Assuming the Exponential Time Hypothesis (ETH), a result of Marx (ToC'10) implies that there is no $f(k)\cdot n^{o(k/\log k)}$ time algorithm that can solve 2-CSPs with $k$ constraints (over a domain of arbitrary large size $n$) for any…
Given a fixed constraint language $\Gamma$, the conservative CSP over $\Gamma$ (denoted by c-CSP($\Gamma$)) is a variant of CSP($\Gamma$) where the domain of each variable can be restricted arbitrarily. A dichotomy is known for conservative…
The random 3-satisfiability (3-SAT) problem is in the unsatisfiable (UNSAT) phase when the clause density $\alpha$ exceeds a critical value $\alpha_s \approx 4.267$. However, rigorously proving the unsatisfiability of a given large 3-SAT…
From the Physics point of view, time is now best described through General Relativity, as part of space-time which is a dynamical object encoding gravity. Time possesses also some intrinsic irreversibility due to thermodynamics, quantum…
Consider a Laurent polynomial with real positive coefficients such that the origin is strictly inside its Newton polytope. Then it is strongly convex as a function of real positive argument. So it has a distinguished Morse critical point…
We prove that there exists $\alpha \in \mathbb{R}$ such that for any $N$ the dicrepancy $D_N$ of the sequence $\{\alpha n !\} ,\, 1\le n \le N$ satisfies $ D_N = O(\log N)$.
In the decimal numeral system, we prove that the well-known Graham's number, $G := \! ^{n}3$ (i.e., $3^{3^{\cdot^{\cdot^{\cdot^{3}}}}}$ ($n$ times)), and any base $3$ tetration whose hyperexponent is larger than $n$ share the same…