We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebrai...
For the approximation of time-dependent data tensors and of solutions to tensor differential equations by tensors of low Tucker rank, we study a computational approach that can be ...
This paper presents an algorithm for extract ing propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural networ...
Smale's 17th Problem asks "Can a zero of n complex polynomial equations in n unknowns be found approximately, on the average [for a suitable probability measure on the s...
We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on th...