Sciweavers

CORR
2008
Springer
118views Education» more  CORR 2008»
14 years 17 days ago
Quantifying Homology Classes
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...
Chao Chen, Daniel Freedman
CORR
2008
Springer
133views Education» more  CORR 2008»
14 years 17 days ago
On Geometric Spanners of Euclidean and Unit Disk Graphs
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...
Iyad A. Kanj, Ljubomir Perkovic
CORR
2008
Springer
109views Education» more  CORR 2008»
14 years 17 days ago
New Combinatorial Complete One-Way Functions
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...
Arist Kojevnikov, Sergey I. Nikolenko
CORR
2008
Springer
104views Education» more  CORR 2008»
14 years 17 days ago
Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic
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 ...
Dietrich Kuske
CORR
2008
Springer
151views Education» more  CORR 2008»
14 years 17 days ago
Geometric Set Cover and Hitting Sets for Polytopes in $R^3$
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...
Sören Laue
CORR
2008
Springer
97views Education» more  CORR 2008»
14 years 17 days ago
Lower bounds for adaptive linearity tests
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...
Shachar Lovett
CORR
2008
Springer
143views Education» more  CORR 2008»
14 years 17 days ago
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations
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...
CORR
2008
Springer
138views Education» more  CORR 2008»
14 years 17 days ago
Computing Minimum Spanning Trees with Uncertainty
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...
CORR
2008
Springer
76views Education» more  CORR 2008»
14 years 17 days ago
Trimming of Graphs, with Application to Point Labeling
Thomas Erlebach, Torben Hagerup, Klaus Jansen, Mor...