Related papers: NP is contained in DTIME(n^O(log^{gamma}))
Hartmanis used Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay that there is an oracle relative to which P is not NP. We refine the technique to strengthen the result, constructing an…
Correct identification of the true gauge symmetry of General Relativity being 3d spatial diffeomorphism invariant(3dDI) (not the conventional infinite tensor product group with principle fibre bundle structure), together with intrinsic time…
Let $\mathbf{P}$ denote the set of prime numbers and, for an appropriate function $h$, define a set $\mathbf{P}_{h}=\{p\in\mathbf{P}: \exists_{n\in\mathbb{N}}\ p=\lfloor h(n)\rfloor\}$. The aim of this paper is to show that every subset of…
By employing Dirac LNH, and a further generalization by Berman (GLNH), we estimate how should vary the total number of nucleons, the energy density, Newton Gravitational constant, the cosmological constant, the magnetic permeability and…
We give a deterministic polynomial-time algorithm to check whether the Galois group $\Gal{f}$ of an input polynomial $f(X) \in \Q[X]$ is nilpotent: the running time is polynomial in $\size{f}$. Also, we generalize the Landau-Miller…
We show that a random group $\Gamma$ in the triangular binomial model $\Gamma(n, p)$ is a.a.s. not left-orderable for $p\in(cn^{-2}, n^{-3/2-\varepsilon})$, where $c, \varepsilon$ are any constants satisfying $\varepsilon>0$,…
Motivated by applications in declarative data analysis, we study $\mathit{Datalog}_{\mathbb{Z}}$---an extension of positive Datalog with arithmetic functions over integers. This language is known to be undecidable, so we propose two…
Erd\H{o}s-Ginzburg-Ziv theorem is a famous theorem in additive number theory, which states any sequence of $2n-1$ integers contains a subsequence of $n$ elements, with their sum being a multiple of $n$. In this article, we provide an…
This paper introduces the XOR-OR-AND normal form (XNF) for logical formulas. It is a generalization of the well-known Conjunctive Normal Form (CNF) where literals are replaced by XORs of literals. As a first theoretic result, we show that…
A Valued Constraint Satisfaction Problem (VCSP) provides a common framework that can express a wide range of discrete optimization problems. A VCSP instance is given by a finite set of variables, a finite domain of labels, and an objective…
We introduce the problem of finding a satisfying assignment to a CNF formula that must further belong to a prescribed input subspace. Equivalent formulations of the problem include finding a point outside a union of subspaces (the…
A Straight-Line Program (SLP) $G$ for a string $T$ is a context-free grammar (CFG) that derives $T$ only, which can be considered as a compressed representation of $T$. In this paper, we show how to encode $G$ in $n \lceil \lg N \rceil + (n…
The main contribution of this work is to construct and analyze stable and high order schemes to efficiently solve the two-dimensional time Caputo-Fabrizio fractional diffusion equation. Based on a third-order finite difference method in…
A dichotomy theorem for counting problems due to Creignou and Hermann states that or any nite set S of logical relations, the counting problem #SAT(S) is either in FP, or #P-complete. In the present paper we show a dichotomy theorem for…
We are interested in computing $k$ most preferred models of a given d-DNNF circuit $C$, where the preference relation is based on an algebraic structure called a monotone, totally ordered, semigroup $(K, \otimes, <)$. In our setting, every…
We study logic for reasoning with if-then formulas describing dependencies between attributes of objects which are observed in consecutive points in time. We introduce semantic entailment of the formulas, show its fixed-point…
Given a CNF formula and a weight for each assignment of values to variables, two natural problems are weighted model counting and distribution-aware sampling of satisfying assignments. Both problems have a wide variety of important…
We observe that an analogue of the Positive Mass Theorem in the time-symmetric case for three-space-time-dimensional general relativity follows trivially from the Gauss-Bonnet theorem. In this case we also have that the spatial slice is…
We study random instances of the weighted $d$-CNF satisfiability problem (WEIGHTED $d$-SAT), a generic W[1]-complete problem. A random instance of the problem consists of a fixed parameter $k$ and a random $d$-CNF formula $\weicnf{n}{p}{k,…
An O(n+m)-time algorithm is presented for counting the number of models of a two Conjunctive Normal Form Formula F that represents a Cactus graph, where n is the number of variables and m is the number of clauses of F. Although, it was…