Related papers: A simple constant-probability RP reduction from NP…
We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a special case. In this paper, we consider a rational…
Consider a monic polynomial of degree $n$ whose subleading coefficients are independent, identically distributed, nondegenerate random variables having zero mean, unit variance, and finite moments of all orders, and let $m \geq 0$ be a…
Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…
We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The…
In [3] we proved the conjecture NP = PSPACE by advanced proof theoretic methods that combined Hudelmaier's cut-free sequent calculus for minimal logic (HSC) [5] with the horizontal compressing in the corresponding minimal Prawitz-style…
Let $\mathbf{R}$ be the sample correlation matrix constructed from $\mathbf{X}\in \mathbb{R}^{p\times n}$, whose entries are independent and identically distributed random variables with mean zero and tail probability condition…
We solve two longstanding major problems in Free Probability. This is achieved by generalising the theory to one with values in arbitrary commutative algebras. We prove the existence of the multi-variable $S$-transform, and show that it is…
We study systems of parameters over finite fields from a probabilistic perspective, and use this to give the first effective Noether normalization result over a finite field. Our central technique is an adaptation of Poonen's closed point…
Various features of the even order poles appearing in the S-matrices of simply-laced affine Toda field theories are analysed in some detail. In particular, the coefficients of first- and second-order singularities appearing in the Laurent…
Bennett and Gill (1981) showed that P^A != NP^A != coNP^A for a random oracle A, with probability 1. We investigate whether this result extends to individual polynomial-time random oracles. We consider two notions of random oracles:…
Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with probability $n^{-a}$, $0 < a < 1/2$, and let $p(n) = n^{1+\epsilon}$, $0 < \epsilon < 1$. We prove that, almost surely, for every…
A value of a CSP instance is typically defined as a fraction of constraints that can be simultaneously met. We propose an alternative definition of a value of an instance and show that, for purely combinatorial reasons, a value of an…
Particular solutions of the Poisson equation can be constructed via Newtonian potentials, integrals involving the corresponding Green's function which in two-dimensions has a logarithmic singularity. The singularity represents a significant…
We propose unifying techniques from probabilistic databases and relational embedding models with the goal of performing complex queries on incomplete and uncertain data. We formalize a probabilistic database model with respect to which all…
We obtain a recurrence relation in $d$ for the average singular value $% \alpha (d)$ of a complex valued $d\times d$\ matrix $\frac{1}{\sqrt{d}}X$ with random i.i.d., N( 0,1) entries, and use it to show that $\alpha (d)$ decreases…
For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…
In the past few years, several new matching models have been proposed and studied that take into account complex distributional constraints. Relevant lines of work include (1) school choice with diversity constraints where students have…
We introduce p-equivalence by asymptotic probabilities, which is a weak almost-equivalence based on zero-one laws in finite model theory. In this paper, we consider the computational complexities of p-equivalence problems for regular…
A short proof of the classic Hardy inequality is presented for $p$-norms with $p>1$. Along the lines of this proof a sharpened version is proved of a recent generalization of Hardy's inequality in the terminology of probability theory. A…
We prove global Lipschitz estimates for Brenier maps between probability measures on $\mathbb{R}^n$ whose densities belong to the family $$ \rho_{U,\,p}=Z_{U,\, p}^{-1}\exp(-\Theta_p(U)), \qquad \Theta_p(t)=p\log\Bigl(1+\frac{t}{p}\Bigr),…