Related papers: Tractability of Multi-Parametric Euler and Wiener …
Given the complexity of modern software systems, it is of great importance that such systems be able to autonomously modify themselves, i.e., self-adapt, with minimal human supervision. It is critical that this adaptation both results in…
We study two-stage adjustable robust linear programming in which the right-hand sides are uncertain and belong to a convex, compact uncertainty set. This problem is NP-hard, and the affine policy is a popular, tractable approximation. We…
This paper is a continuation of work arXiv:2006.09583 devoted to establishment of the convergence rate in the strong invariance principle for cumulative processes. We establish optimal rate of convergence for the case when regeneration…
Fix an integer k, and let I(l), l=1,2,..., be a sequence of k-dimensional vectors of multiple Wiener-It\^o integrals with respect to a general Gaussian process. We establish necessary and sufficient conditions to have that, as l diverges,…
We study the general integer programming (IP) problem of optimizing a separable convex function over the integer points of a polytope: $\min \{f(\mathbf{x}) \mid A\mathbf{x} = \mathbf{b}, \, \mathbf{l} \leq \mathbf{x} \leq \mathbf{u}, \,…
In this dissertation we study the tractability of the information-based complexity $n(\varepsilon,d)$ for $d$-variate function approximation problems. In the deterministic setting for many unweighted problems the curse of dimensionality…
We present a new and compelling approach to the efficient solution of important computational problems that arise in the context of abstract argumentation. Our approach makes known algorithms defined for restricted fragments generally…
The solution of a problem arising in integrable systems requires sharp asymptotics for the inverses and determinants of truncated Wiener-Hopf operators, both in the regular case (where the non-truncated Wiener-Hopf operator is invertible)…
We present an algorithm to invert the Euler function $\phi(m)$. The algorithm, for a given $n \geq 1$, in polynomial time ``on average'', finds the set $\Psi(n)$ of all solutions $m$ to $\phi(m) = n$. In fact, in the worst case, $\Psi(n)$…
In this paper, we introduce the polynomial continued fraction, a close relative of the well-known simple continued fraction expansions which are widely used in number theory and in general. While they may not possess all the intriguing…
The article is devoted to the practical material on expansions and mean-square approximations of specific iterated Ito and Stratonovich stochastic integrals of multiplicities 1 to 6 with respect to components of the multidimensional Wiener…
We formally investigate some computational obstacles to tractability of computing the variety determined by K complex polynomials in N boolean variables. We show that using algebraic methods for solving combinatorial problems, the obstacles…
Computing expected predictions of discriminative models is a fundamental task in machine learning that appears in many interesting applications such as fairness, handling missing values, and data analysis. Unfortunately, computing…
Multidimensional packing problems generalize the classical packing problems such as Bin Packing, Multiprocessor Scheduling by allowing the jobs to be $d$-dimensional vectors. While the approximability of the scalar problems is well…
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…
Computing the Euler genus of a graph is a fundamental problem in graph theory and topology. It has been shown to be NP-hard by [Thomassen '89] and a linear-time fixed-parameter algorithm has been obtained by [Mohar '99]. Despite extensive…
Many data management applications must deal with data which is uncertain, incomplete, or noisy. However, on existing uncertain data representations, we cannot tractably perform the important query evaluation tasks of determining query…
"Higher-order Wiener-Wintner averages" were constructed by Assani, Folks, and Moore to quantitatively control multiple recurrence averages. Systems in which these averages converge at a polynomial rate for a sufficiently large subset are…
Query evaluation on probabilistic databases is generally intractable (#P-hard). Existing dichotomy results have identified which queries are tractable (or safe), and connected them to tractable lineages. In our previous work, using…
A natural criticism of the optimal protocol of the irreversible work found for weakly driven processes is its experimental difficulty in being implementable due to its singular part. In this work, I explore the possibility of taking its…