15 search results - page 2 / 3 » mfcs 2001 |
MFCS
2001
Springer
14 years 2 months ago
2001
Springer
We study different computable versions of Baire’s Category Theorem in computable analysis. Similarly, as in constructive analysis, different logical forms of this theorem lead ...
MFCS
2001
Springer
14 years 2 months ago
2001
Springer
We consider words indexed by linear orderings. These extend finite, (bi-)infinite words and words on ordinals. We introduce finite automata and rational expressions for these w...
MFCS
2001
Springer
14 years 2 months ago
2001
Springer
We describe an explicit simulation of 2-way nondeterministic automata by 1-way alternating automata with quadratic blow-up. We first describe the construction for automata on fin...
MFCS
2001
Springer
14 years 2 months ago
2001
Springer
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...
MFCS
2001
Springer
14 years 2 months ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...