相关论文: Deterministic Black-Box Identity Testing $\pi$-Ord…

An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search.…

Let $\Phi = (V, \mathcal{C})$ be a constraint satisfaction problem on variables $v_1,\dots, v_n$ such that each constraint depends on at most $k$ variables and such that each variable assumes values in an alphabet of size at most $[q]$.…

We compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…

Non-deterministic read-once branching programs, also known as non-deterministic free binary decision diagrams (nFBDD), are a fundamental data structure in computer science for representing Boolean functions. In this paper, we focus on…

Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…

We study the identity testing problem for high-dimensional distributions. Given as input an explicit distribution $\mu$, an $\varepsilon>0$, and access to sampling oracle(s) for a hidden distribution $\pi$, the goal in identity testing is…

We consider the bin packing problem with d different item sizes s_i and item multiplicities a_i, where all numbers are given in binary encoding. This problem formulation is also known as the 1-dimensional cutting stock problem. In this…

We extend the well known characterization of $\vpws$ as the class of polynomials computed by polynomial size arithmetic branching programs to other complexity classes. In order to do so we add additional memory to the computation of…

It is proved that the universal degree bound for separating polynomial invariants of a finite abelian group (in non-modular characteristic) is strictly smaller than the universal degree bound for generators of polynomial invariants, unless…

We give an algorithm for properly learning Poisson binomial distributions. A Poisson binomial distribution (PBD) of order $n$ is the discrete probability distribution of the sum of $n$ mutually independent Bernoulli random variables. Given…

Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials. Under some genericity assumptions, %% on these polynomials, we prove that the optimality conditions always hold on…

In this paper, we devise two algorithms for the problem of testing $q$-monomials of degree $k$ in any multivariate polynomial represented by a circuit, regardless of the primality of $q$. One is an $O^*(2^k)$ time randomized algorithm. The…

We study the minimum number of constraints needed to formulate random instances of the maximum stable set problem via linear programs (LPs), in two distinct models. In the uniform model, the constraints of the LP are not allowed to depend…

We study the existence of polynomial kernels for the problem of deciding feasibility of integer linear programs (ILPs), and for finding good solutions for covering and packing ILPs. Our main results are as follows: First, we show that the…

A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be…

The r largest order statistics approach is widely used in extreme value analysis because it may use more information from the data than just the block maxima. In practice, the choice of r is critical. If r is too large, bias can occur; if…

Recently, Xia introduced a deterministic variation $\phi_{\sigma}$ of Defant and Kravitz's stack-sorting maps for set partitions and showed that any set partition $p$ is sorted by $\phi^{N(p)}_{aba}$, where $N(p)$ is the number of distinct…

This paper explores a common class of diagonal-norm summation by parts (SBP) operators found in the literature, which can be parameterized by an integer triple $(s,t,r)$ representing the interior order of accuracy ($2s)$, the boundary order…

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

For three decades binary decision diagrams, a data structure efficiently representing Boolean functions, have been widely used in many distinct contexts like model verification, machine learning, cryptography and also resolution of…