We develop a method for measuring homology classes. This involves three problems. First, we define the size of a homology class, using ideas from relative homology. Second, we defi...
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometri...
In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we presen...
We investigate the relation between the theory of the iterations in the sense of Shelah-Stupp and of Muchnik, resp., and the theory of the base structure for several logics. These ...
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Abstract. Monotone systems of polynomial equations (MSPEs) are systems of fixedpoint equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomia...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...