19 search results - page 3 / 4 » stacs 1999 |
STACS
1999
Springer
13 years 11 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
STACS
1999
Springer
13 years 11 months ago
1999
Springer
We demonstrate how to use Lautemann's proof that BPP is in p 2 to exhibit that BPP is in RPPromiseRP. Immediate consequences show that if PromiseRP is easy or if there exist q...
STACS
1999
Springer
13 years 11 months ago
1999
Springer
We investigate the problem of routing traffic through a congested network in an environment of non-cooperative users. We use the worst-case coordination ratio suggested by Koutsou...
STACS
1999
Springer
13 years 11 months ago
1999
Springer
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...