FCT
2005
Springer
14 years 4 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
FCT
2005
Springer
14 years 4 months ago
2005
Springer
FCT
2005
Springer
14 years 5 months ago
2005
Springer
In this paper we study the interplay between metric and order completeness of semantic domains equipped with generalised distances. We prove that for bounded complete posets direct...
FCT
2005
Springer
14 years 5 months ago
2005
Springer
We consider terms of simply typed lambda calculus in which copy of a subterm may not be inserted to the argument of itself during the reduction. The terms form wide class which inc...
FCT
2005
Springer
14 years 5 months ago
2005
Springer
Unambiguity in alternating Turing machines has received considerable attention in the context of analyzing globally-unique games by Aida et al. [ACRW04] and in the design of effic...
FCT
2005
Springer
14 years 5 months ago
2005
Springer
A set of points shown on the map usually represents special sites like cities or towns in a country. If the map in the interactive geographical information system (GIS) is browsed ...
FCT
2005
Springer
14 years 5 months ago
2005
Springer
We refine the genericity concept of Ambos-Spies, by assigning a real number in [0, 1] to every generic set, called its generic density. We construct sets of generic density any E...
FCT
2005
Springer
14 years 5 months ago
2005
Springer
FCT
2005
Springer
14 years 5 months ago
2005
Springer
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
FCT
2005
Springer
14 years 5 months ago
2005
Springer
Leftist grammars can be characterized in terms of rules of the form a → ba and cd → d, without distinction between terminals and nonterminals. They were introduced by Motwani e...