Related papers: Tractability of Multi-Parametric Euler and Wiener …
We consider approximating analytic functions on the interval $[-1,1]$ from their values at a set of $m+1$ equispaced nodes. A result of Platte, Trefethen \& Kuijlaars states that fast and stable approximation from equispaced samples is…
The goal of the present paper is to prove that if a weak limit of a consistent approximation scheme of compressible complete Euler system in the full space $ \mathbb{R}^d,\; d=2,3 $ is a weak solution of the system then eventually the…
This paper considers the strong error analysis of the Euler and fast Euler methods for nonlinear overdamped generalized Langevin equations driven by the fractional noise. The main difficulty lies in handling the interaction between the…
We consider the (barotropic) Euler system describing the motion of a compressible inviscid fluid driven by a stochastic forcing. Adapting the method of convex integration we show that the initial value problem is ill-posed in the class of…
Phase transitions in combinatorial problems have recently been shown to be useful in locating "hard" instances of combinatorial problems. The connection between computational complexity and the existence of phase transitions has been…
We introduce a variational theory for processes adapted to the multi-dimensional Brownian motion filtration. The theory provides a differential structure which describes the infinitesimal evolution of Wiener functionals at very small…
Many fundamental problems in artificial intelligence, knowledge representation, and verification involve reasoning about sets and relations between sets and can be modeled as set constraint satisfaction problems (set CSPs). Such problems…
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…
A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f:[0,1]->R is computable relative to…
In the Vector Connectivity problem we are given an undirected graph $G=(V,E)$, a demand function $\phi\colon V\to\{0,\ldots,d\}$, and an integer $k$. The question is whether there exists a set $S$ of at most $k$ vertices such that every…
Consider a system of n polynomial equations and r polynomial inequations in n indeterminates of degree bounded by d with coefficients in a polynomial ring of s parameters with rational coefficients of bit-size at most $\sigma$. From the…
Algorithms for learning decision trees often include heuristic local-search operations such as (1) adjusting the threshold of a cut or (2) also exchanging the feature of that cut. We study minimizing the number of classification errors by…
We provide a number of algorithmic results for the following family of problems: For a given binary m\times n matrix A and integer k, decide whether there is a "simple" binary matrix B which differs from A in at most k entries. For an…
Variational Bayes (VB) is a popular estimation method for Bayesian inference. However, most existing VB algorithms are restricted to cases where the likelihood is tractable, which precludes their use in many important situations. Tran et…
A detailed analysis of the remainder obtained by truncating the Euler series up to the $n$th-order term is presented. In particular, by using an approach recently proposed by Weniger, asymptotic expansions of the remainder, both in inverse…
Probabilistic models learned as density estimators can be exploited in representation learning beside being toolboxes used to answer inference queries only. However, how to extract useful representations highly depends on the particular…
We derive computationally tractable methods to select a small subset of experiment settings from a large pool of given design points. The primary focus is on linear regression models, while the technique extends to generalized linear models…
The strong numerical approximation of semilinear stochastic partial differential equations (SPDEs) driven by infinite dimensional Wiener processes is investigated. There are a number of results in the literature that show that Euler-type…
We investigate the computational complexity of problems on toric ideals such as normal forms, Gr\"obner bases, and Graver bases. We show that all these problems are strongly NP-hard in the general case. Nonetheless, we can derive efficient…
We study the computational complexity of fundamental problems over the $p$-adic numbers ${\mathbb Q}_p$ and the $p$-adic integers ${\mathbb Z}_p$. Gu\'epin, Haase, and Worrell proved that checking satisfiability of systems of linear…