One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES (k) such that any set S of at least fES (k) points in general posit...
Oswin Aichholzer, Thomas Hackl, Clemens Huemer, Fe...
It is shown that the error control problem in random network coding can be reformulated as a generalized decoding problem for rank-metric codes. This result allows many of the too...