Related papers: $P \ne NP$, propositional proof complexity, and re…
We present an $O(n\log n)$-time algorithm that determines whether a given planar $n$-gon is weakly simple. This improves upon an $O(n^2\log n)$-time algorithm by Chang, Erickson, and Xu (2015). Weakly simple polygons are required as input…
We study the consensus-halving problem of dividing an object into two portions, such that each of $n$ agents has equal valuation for the two portions. The $\epsilon$-approximate consensus-halving problem allows each agent to have an…
Given a finite point set $P$ in ${\mathbb R}^d$, and $\epsilon>0$ we say that $N\subseteq{ \mathbb R}^d$ is a weak $\epsilon$-net if it pierces every convex set $K$ with $|K\cap P|\geq \epsilon |P|$. We show that for any finite point set in…
We study from the proof complexity perspective the (informal) proof search problem: Is there an optimal way to search for propositional proofs? We note that for any fixed proof system there exists a time-optimal proof search algorithm.…
It is well-known (cf. K.-Pudl\'ak 1989) that a polynomial time algorithm finding tautologies hard for a propositional proof system $P$ exists iff $P$ is not optimal. Such an algorithm takes $1^{(k)}$ and outputs a tautology $\tau_k$ of size…
In this paper we consider the inference rules of System P in the framework of coherent imprecise probabilistic assessments. Exploiting our algorithms, we propagate the lower and upper probability bounds associated with the conditional…
The convergence and optimality of adaptive mixed finite element methods for the Poisson equation are established in this paper. The main difficulty for mixed finite element methods is the lack of minimization principle and thus the failure…
We survey lower-bound results in complexity theory that have been obtained via newfound interconnections between propositional proof complexity, boolean circuit complexity, and query/communication complexity. We advocate for the theory of…
Dickson's Lemma is a simple yet powerful tool widely used in termination proofs, especially when dealing with counters or related data structures. However, most computer scientists do not know how to derive complexity upper bounds from such…
We introduce a variant of PCPs, that we refer to as rectangular PCPs, wherein proofs are thought of as square matrices, and the random coins used by the verifier can be partitioned into two disjoint sets, one determining the row of each…
Let $P$ be an orthogonal polygon. Consider a sliding camera that travels back and forth along an orthogonal line segment $s\in P$ as its \emph{trajectory}. The camera can see a point $p\in P$ if there exists a point $q\in s$ such that $pq$…
This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…
We consider the problem of robust polynomial regression, where one receives samples $(x_i, y_i)$ that are usually within $\sigma$ of a polynomial $y = p(x)$, but have a $\rho$ chance of being arbitrary adversarial outliers. Previously, it…
The goal of the present paper is to prove that if a weak limit of a consistent approximation scheme of compressible complete Euler system in the full space $ \mathbb{R}^d,\; d=2,3 $ is a weak solution of the system then eventually the…
We prove that persuasion is an NP-complete problem.
The Aubin-Lions lemma and its variants play crucial roles for the existence of weak solutions of nonlinear evolutionary PDEs. In this paper, we aim to develop some compactness criteria that are analogies of the Aubin--Lions lemma for the…
We claim to resolve the P=?NP problem via a formal argument for P=NP.
For any abelian group $A$, we prove an asymptotic formula for the number of $A$-extensions $K/\mathbb{Q}$ of bounded discriminant such that the associated norm one torus $R_{K/\mathbb{Q}}^1 \mathbb{G}_m$ satisfies weak approximation. We are…
We prove a lower bound on the canonical height associated to polynomials over number fields evaluated at points with infinite forward orbit. The lower bound depends only on the degree of the polynomial, the degree of the number field, and…
The standard proof of NP-Hardness of 3DM provides a power-$4$ reduction of 3SAT to 3DM. In this note, we provide a linear-time reduction. Under the exponential time hypothesis, this reduction improves the runtime lower bound from…