Related papers: On the Chen Conjecture regarding the complexity of…

While 3-SAT is NP-hard, 2-SAT is solvable in polynomial time. Austrin, Guruswami, and H\r{a}stad roved a result known as "$(2+\varepsilon)$-SAT is NP-hard" [FOCS'14/SICOMP'17]. They showed that the problem of distinguishing k-CNF formulas…

An algorithm for answering conjunctive queries over SHIQ knowledge bases that is coNP in data complexity is given. The algorithm is based on the tableau algorithm for reasoning with individuals in SHIQ. The blocking conditions of the…

We prove that QCSP$(\mathbb{N};x=y\rightarrow y=z)$ is PSpace-complete, settling a question open for more than ten years. This completes the complexity classification for the QCSP over equality languages as a trichotomy between Logspace,…

In this paper, I consider a fine-grained dichotomy of Boolean counting constraint satisfaction problem (#CSP), under the exponential time hypothesis of counting version (#ETH). Suppose $\mathscr{F}$ is a finite set of algebraic…

It was recently shown by Atserias, Buss and Mueller that the standard complexity-theoretic conjecture NEXP not in P / poly is consistent with the relatively strong bounded arithmetic theory V^0_2, which can prove a substantial part of…

Let $\Phi_{n}(q)$ denote the $n$-th cyclotomic polynomial in $q$. Recently, Guo and Schlosser [Constr. Approx. 53 (2021), 155--200] put forward the following conjecture: for an odd integer $n>1$, \begin{align*}…

In this paper we prove the probabilistic continuous complexity conjecture. In continuous complexity theory, this states that the complexity of solving a continuous problem with probability approaching 1 converges (in this limit) to the…

Borwein and Choi conjectured that a polynomial $P(x)$ with coefficients $\pm1$ of degree $N-1$ is cyclotomic iff $$P(x)=\pm \Phi_{p_1}(\pm x)\Phi_{p_2}(\pm x^{p_1})\cdots \Phi_{p_r}(\pm x^{p_1p_2\cdots p_{r-1}})$$ where $N=p_1p_2\cdots…

We study Constraint Satisfaction Problems (CSPs) in an infinite context. We show that the dichotomy between easy and hard problems -- established already in the finite case -- presents itself as the strength of the corresponding De…

We establish the \emph{inverse conjecture for the Gowers norm over finite fields}, which asserts (roughly speaking) that if a bounded function $f: V \to \C$ on a finite-dimensional vector space $V$ over a finite field $\F$ has large Gowers…

We prove that the homotopy class of a Morin mapping f: P^p --> Q^q with p-q odd contains a cusp mapping. This affirmatively solves a strengthened version of the Chess conjecture [DS Chess, A note on the classes [S_1^k(f)], Proc. Symp. Pure…

Let \Gamma be a structure with a finite relational signature and a first-order definition in (R;*,+) with parameters from R, that is, a relational structure over the real numbers where all relations are semi-algebraic sets. In this article,…

The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable when the model-complete core of the template…

Let $k$ be an algebraically closed field of characteristic $p>0$, let G=GL_n be the general linear group over $k$, let g=gl_n be its Lie algebra and let $D_s$ be subalgebra of the divided power algebra of g^* spanned by the divided power…

We investigate deep composite polynomial approximations of continuous but non-differentiable functions with algebraic cusp singularities. The functions in focus consist of finitely many cusp terms of the form $|x-a_j|^{\alpha_j}$ with…

A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…

In this short note, we find an equivalent combinatorial condition only involving finite sums under which a centered Gaussian random vector with multinomial covariance matrix satisfies the Gaussian product inequality (GPI) conjecture. These…

We prove the divisibility conjecture on sums of even powers of $q$-binomial coefficients, which was recently proposed by Guo, Schlosser and Zudilin. Our proof relies on two $q$-harmonic series congruences due to Shi and Pan.

This article describes a formal strategy of geometric complexity theory (GCT) to resolve the {\em self referential paradox} in the $P$ vs. $NP$ and related problems. The strategy, called the {\em flip}, is to go for {\em explicit proofs} of…

We present a simple, natural #P-complete problem. Let G be a directed graph, and let k be a positive integer. We define q(G;k) as follows. At each vertex v, we place a k-dimensional complex vector x_v. We take the product, over all edges…