Related papers: Finding cores of random 2-SAT formulae via Poisson…

The highly structured search algorithm proposed by Hogg[Phys.Rev.Lett. 80,2473(1998)] is implemented experimentally for the 1-SAT problem in a single search step by using nuclear magnetic resonance technique with two-qubit sample. It is the…

This is the latest in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. In the previous papers, we have proved that the sat CNF problem is polynomially reduced to the problem of finding a…

We prove that for any $k\geq3$ for clause/variable ratios up to the Gibbs uniqueness threshold of the corresponding Galton-Watson tree, the number of satisfying assignments of random $k$-SAT formulas is given by the `replica symmetric…

In signed k-SAT problems, one fixes a set M and a set $\mathcal S$ of subsets of M, and is given a formula consisting of a disjunction of m clauses, each of which is a conjunction of k literals. Each literal is of the form "$x \in S$",…

We study the second-order polaronic resonance between 2-LO-phonon states and p-shell electron states in a quantum dot. We show that the spectrum in the resonance area can be quantitatively reproduced by a theoretical model using only…

It is well known that there is a sharp density threshold for a random $r$-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal rule. Also, above the satisfiability threshold, where a…

This paper develops a graphical calculus to determine the $n$-shifted Poisson structures on finitely generated semi-free commutative differential graded algebras. When applied to the Chevalley-Eilenberg algebra of an ordinary Lie algebra,…

Let $f:\{-1,1\}^n$ be a polynomial with at most $s$ non-zero real coefficients. We give an algorithm for exactly reconstructing f given random examples from the uniform distribution on $\{-1,1\}^n$ that runs in time polynomial in $n$ and…

This paper introduces AL$\ell_0$CORE, a new form of probabilistic non-negative tensor decomposition. AL$\ell_0$CORE is a Tucker decomposition where the number of non-zero elements (i.e., the $\ell_0$-norm) of the core tensor is constrained…

A method of constructing specific polynomial representations $f(x)$ over the finite field $\mathbb{F}_p$ of the square roots function modulo a prime $p = 2^kn + 1$, $n$ odd, is presented. The formulas for the cases $k = 2$, $3$ and $4$ are…

This work gives an explicit construction of a family of error correcting codes for the binary deletion channel and for the Poisson repeat channel. In the binary deletion channel with parameter $p$ (BDC$_p$) every bit is deleted…

In this paper we present a novel fast method to solve Poisson equation in an arbitrary two dimensional region with Neumann boundary condition. The basic idea is to solve the original Poisson problem by a two-step procedure: the first one…

We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3-list-coloring. Our algorithms are based on a constraint satisfaction (CSP) formulation of these problems. 3-SAT is equivalent to…

Let the $A$-cusps of a dense subset $\mathcal{P}^*\in[\sqrt{N},N]$ of primes be points $\alpha\in\mathbb{R}/\mathbb{Z}$ that are such that $|\sum_{\substack{p\in\mathcal{P}^*}} e(\alpha p)|\ge |\mathcal{P}^*|/A$. We establish that any…

We consider the problem of partitioning a line segment into two subsets, so that $n$ finite measures all have the same ratio of values for the subsets. Letting $\alpha\in[0,1]$ denote the desired ratio, this generalises the PPA-complete…

In this paper, Particle-in-Cell algorithms for the Vlasov-Poisson system are presented based on its Poisson bracket structure. The Poisson equation is solved by finite element methods, in which the appropriate finite element spaces are…

With the proliferation of mobile technology and IT development, people can use social network services at any place and anytime. Among many social network mining problems, identifying cohesive subgraphs attract many attentions from…

We prove that the size of the e-core of a partition taken under the Poissonised Plancherel measure converges in distribution to, as the Poisson parameter goes to infinity and after a suitable renormalisation, a sum of e-1 mutually…

We give an alternative proof of a conjecture of Bollob\'as, Brightwell and Leader, first proved by Peter Allen, stating that the number of boolean functions definable by 2-SAT formulae is $(1+o(1))2^{\binom{n+1}{2}}$. One step in the proof…

We study an Achlioptas-process version of the random k-SAT process: a bounded number of k-clauses are drawn uniformly at random at each step, and exactly one added to the growing formula according to a particular rule. We prove the…