Related papers: Computational Complexity of Smooth Differential Eq…
Optimization problems arising in data science have given rise to a number of new derivative-based optimization methods. Such methods often use standard smoothness assumptions -- namely, global Lipschitz continuity of the gradient function…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
In this paper, we study the regularities of solutions of nonlinear stochastic partial differential equations in the framework of Hilbert scales. Then we apply our general result to several typical nonlinear SPDEs such as stochastic Burgers…
We analyze the computational complexity of problems related to case-based planning: planning when a plan for a similar instance is known, and planning from a library of plans. We prove that planning from a single case has the same…
Recently it was shown that, for every fixed k>1, given a finite simply connected simplicial complex X, the kth homotopy group \pi_k(X) can be computed in time polynomial in the number n of simplices of X. We prove that this problem is…
Assuming Calabi symmetry, we prove that a numerical condition ensures the solvability of the complex Hessian quotient equation, as conjectured by Sz\'ekelyhidi. We also propose a conjecture on the existence of a $k$-subharmonic…
We study the transference through finite index extensions of the notion of equational coherence, as well as its effective counterpart. We deduce an explicit algorithm for solving the following algorithmic problem about size two integral…
We study two complexity notions of groups - a computable Scott sentence and the index set of a group. Finding the exact complexity of one of them usually involves finding the complexity of the other, but this is not the case sometimes. J.…
The relaxation complexity $\mathrm{rc}(X)$ of the set of integer points $X$ contained in a polyhedron is the smallest number of facets of any polyhedron $P$ such that the integer points in $P$ coincide with $X$. It is a useful tool to…
This paper is dedicated to studying pointwise estimates of the fundamental solution for the higher order Schr\"{o}dinger equation: % we investigate the fundamental solution of the higher order Schr\"{o}dinger equation…
We perform a smoothed analysis of the GCC-condition number C(A) of the linear programming feasibility problem \exists x\in\R^{m+1} Ax < 0. Suppose that \bar{A} is any matrix with rows \bar{a_i} of euclidean norm 1 and, independently for all…
We consider dissipative strongly competitive systems $\dot{x}_{i}=x_{i}f_{i}(x)$ of ordinary differential equations. It is known that for a wide class of such systems there exists an invariant attracting hypersurface $\Sigma$, called the…
This paper proves that arrangement of music is NP-hard when subject to various constraints: avoiding musical dissonance, limiting how many notes can be played simultaneously, and limiting transition speed between chords. These results imply…
We address complexity issues for linear differential equations in characteristic $p>0$: resolution and computation of the $p$-curvature. For these tasks, our main focus is on algorithms whose complexity behaves well with respect to $p$. We…
Smoothness and low dimensional structures play central roles in improving generalization and stability in learning and statistics. This work combines techniques from semi-infinite constrained learning and manifold regularization to learn…
Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…
The Swift--Hohenberg equation is a widely studied fourth-order model, originally proposed to describe hydrodynamic fluctuations. It admits an energy-dissipation law and, under suitable assumptions, bounded solutions. Many…
Implicit computational complexity is a lively area of theoretical computer science, which aims to provide machine-independent characterizations of relevant complexity classes. % for uniformity with subsequent uses >> 1960s (but feel free to…
The abstract of the original paper was as follows: We explore some questions related to one of Brizolis: does every prime p have a pair (g,h) such that h is a fixed point for the discrete logarithm with base g? We extend this question to…
It is well known that Sparse PCA (Sparse Principal Component Analysis) is NP-hard to solve exactly on worst-case instances. What is the complexity of solving Sparse PCA approximately? Our contributions include: 1) a simple and efficient…