相关论文: Hardness of the Binary Covering Radius Problem in …

In 2011, Aaronson gave a striking proof, based on quantum linear optics, showing that the problem of computing the permanent of a matrix is #P-hard. Aaronson's proof led naturally to hardness of approximation results for the permanent, and…

$\delta$-Covering, for some covering range $\delta>0$, is a continuous facility location problem on undirected graphs where all edges have unit length. The facilities may be positioned on the vertices as well as on the interior of the…

In this paper, we consider the related problems of multicalibration -- a multigroup fairness notion and omniprediction -- a simultaneous loss minimization paradigm, both in the distributional and online settings. The recent work of Garg et…

We establish a new theory of regularity for elliptic complex valued second order equations of the form $\mathcal L=$div$A(\nabla\cdot)$, when the coefficients of the matrix $A$ satisfy a natural algebraic condition, a strengthened version…

Binary neural networks leverage $\mathrm{Sign}$ function to binarize weights and activations, which require gradient estimators to overcome its non-differentiability and will inevitably bring gradient errors during backpropagation. Although…

We consider approximation algorithms for packing integer programs (PIPs) of the form $\max\{\langle c, x\rangle : Ax \le b, x \in \{0,1\}^n\}$ where $c$, $A$, and $b$ are nonnegative. We let $W = \min_{i,j} b_i / A_{i,j}$ denote the width…

We provide fast algorithms for overconstrained $\ell_p$ regression and related problems: for an $n\times d$ input matrix $A$ and vector $b\in\mathbb{R}^n$, in $O(nd\log n)$ time we reduce the problem $\min_{x\in\mathbb{R}^d} \|Ax-b\|_p$ to…

The paper deals with a nontrivial density result for $C^m(\overline{\Omega})$ functions, with $m\in{\mathbb N}\cup\{\infty\}$, in the space $$W^{k,\ell,p}(\Omega;\Gamma)= \left\{u\in W^{k,p}(\Omega): u_{|\Gamma}\in…

We perform a combined analysis of two stringent constraints on two Higgs doublet model, coming from the recently announced CLEO II bound on $B(b \rightarrow s \gamma)$ and $Z \rightarrow b \overline b$ and from the recent LEP data on the…

We give simple deterministic reductions demonstrating the NP-hardness of approximating the nearest codeword problem and minimum distance problem within arbitrary constant factors (and almost-polynomial factors assuming NP cannot be solved…

Let $\phi$ be an analytic map taking the unit disk $\mathbb{D}$ into itself. We establish that the class of composition operators $f \mapsto C_\phi(f) = f \circ \phi$ exhibits a rather strong rigidity of non-compact behaviour on the Hardy…

A connected graph has a $(k,\ell)$-cover if each of its edges is contained in at least $\ell$ cliques of order $k$. Motivated by recent advances in extremal combinatorics and the literature on edge modification problems, we study the…

In this paper we obtain improved iteration complexities for solving $\ell_p$ regression. We provide methods which given any full-rank $\mathbf{A} \in \mathbb{R}^{n \times d}$ with $n \geq d$, $b \in \mathbb{R}^n$, and $p \geq 2$ solve…

In this paper we present a new gap-creating randomized self-reduction for parameterized Maximum Likelihood Decoding problem over $\mathbb{F}_p$ ($k$-MLD$_p$). The reduction takes a $k$-MLD$_p$ instance with $k\cdot n$ vectors as input, runs…

This paper is concerned with the elliptic problem for a scalar field equation with a forcing term \begin{equation} \tag{P}-\Delta u+u=u^p+ \kappa \mu \quad \mbox{in} \quad{\bf R}^N, \quad u>0 \quad \mbox{in} \quad {\bf R}^N, \quad u(x)\to…

The Capacitated Sum of Radii problem involves partitioning a set of points $P$, where each point $p\in P$ has capacity $U_p$, into $k$ clusters that minimize the sum of cluster radii, such that the number of points in the cluster centered…

Recent works in dimensionality reduction for regression tasks have introduced the notion of sensitivity, an estimate of the importance of a specific datapoint in a dataset, offering provable guarantees on the quality of the approximation…

We develop a new refinement of the Kato's inequality and using this refinement we obtain several upper bounds for the numerical radius of a bounded linear operator as well as the product of operators, which improve the well known existing…

We present an analytical derivation of the volume fractions for random close packing (RCP) in both $d=3$ and $d=2$, based on the same methodology. Using suitably modified nearest neigbhour statistics for hard spheres, we obtain…

A plasma impedance probe (PIP) is a type of in-situ, radio-frequency (RF) probe that is traditionally used to measure plasma properties (e.g. density) in low-density environments such as the Earth's ionosphere. We believe that PIPs are…