Related papers: Computational Complexity of Smooth Differential Eq…

We say that a hypercomplex nilpotent Lie algebra is $\mathbb{H}$-solvable if there exists a sequence of $\mathbb{H}$-invariant subalgebras $\mathfrak{g}_1^{ \mathbb{H}}\supset\mathfrak{g}_2^{…

Let $\omega_\mathfrak{g}$ be a Lie algebra valued differential $1$-form on a manifold $M$ satisfying the structure equations $d \omega_\mathfrak{g} + \frac{1}{2} \omega_\mathfrak{g}\wedge \omega_\mathfrak{g}=0$ where $\mathfrak{g}$ is…

We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $P$ of degree $d$ in time $O(d\log d)$, with a low multiplicative constant independent of the precision. Subsequent evaluations of $P$…

We consider the class of convex minimization problems, composed of a self-concordant function, such as the $\log\det$ metric, a convex data fidelity term $h(\cdot)$ and, a regularizing -- possibly non-smooth -- function $g(\cdot)$. This…

We introduce the smoothed analysis of algorithms, which is a hybrid of the worst-case and average-case analysis of algorithms. In smoothed analysis, we measure the maximum over inputs of the expected performance of an algorithm under small…

We study a class of functional problems reducible to computing $f^{(n)}(x)$ for inputs $n$ and $x$, where $f$ is a polynomial-time bijection. As we prove, the definition is robust against variations in the type of reduction used in its…

We introduce a new algorithm for computing the periods of a smooth complex projective hypersurface. The algorithm intertwine with a new method for computing an explicit basis of the singular homology of the hypersurface. It is based on…

Many convex optimization problems have structured objective function written as a sum of functions with different types of oracles (full gradient, coordinate derivative, stochastic gradient) and different evaluation complexity of these…

We investigate the class of regular-ordered word equations. In such equations, each variable occurs at most once in each side and the order of the variables occurring in both sides is the preserved (the variables can be, however, separated…

In the spanning-tree congestion problem ($\mathsf{STC}$), we are given a graph $G$, and the objective is to compute a spanning tree of $G$ that minimizes the maximum edge congestion. While $\mathsf{STC}$ is known to be $\mathbb{NP}$-hard,…

Scarf's lemma is one of the fundamental results in combinatorics, originally introduced to study the core of an N-person game. Over the last four decades, the usefulness of Scarf's lemma has been demonstrated in several important…

This paper classifies the complexity of various teaching models by their position in the arithmetical hierarchy. In particular, we determine the arithmetical complexity of the index sets of the following classes: (1) the class of uniformly…

A collection of algorithms is described for numerically computing with smooth functions defined on the unit sphere. Functions are approximated to essentially machine precision by using a structure-preserving iterative variant of Gaussian…

Let $(M, g)$ be a closed Riemannian manifold of dimension $n \geq 3$, and let $h \in C^1(M)$ be such that the operator $\Delta_g + h$ is coercive. Fix $x_0 \in M$ and $s \in (0, 2)$. We obtain uniform bounds on the solutions of the critical…

The total complexity (measured as the total number of gradient computations) of a stochastic first-order optimization algorithm that finds a first-order stationary point of a finite-sum smooth nonconvex objective function $F(w)=\frac{1}{n}…

We show that the smoothed complexity of the logarithm of Renegar's condition number is O(log (n/sigma)).

In this paper the existence of a smooth density is proved for the solution of an SDE, with locally Lipschitz coefficients and semi-monotone drift, under H\"ormander condition. We prove the nondegeneracy condition for the solution of the…

The complexity of graph homomorphisms has been a subject of intense study [11, 12, 4, 42, 21, 17, 6, 20]. The partition function $Z_{\mathbf A}(\cdot)$ of graph homomorphism is defined by a symmetric matrix $\mathbf A$ over $\mathbb C$. We…

The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…

We relate the complexity of both differential and $q$-difference equations of order one and degree one and their solutions. Our point of view is to show that if the solutions are complicated, the initial equation is complicated too. In this…