6 search results - page 1 / 2 » stacs 1992 |
STACS
1992
Springer
13 years 10 months ago
1992
Springer
STACS
1991
Springer
13 years 9 months ago
1991
Springer
Formal power series over non-commuting variables have been investigated as representations of the behavior of automata with multiplicities. Here we introduce and investigate the co...
STACS
1992
Springer
13 years 10 months ago
1992
Springer
We show that the graph isomorphism problem is low for PP and for C=P, i.e., it does not provide a PP or C=P computation with any additional power when used as an oracle. Furthermor...
STACS
1992
Springer
13 years 10 months ago
1992
Springer
In this paper we give a practical and e cient output-sensitive algorithm for constructing the display of a polyhedral terrain. It runs in Od + nlog2 n time and uses On n space, wh...
STACS
1992
Springer
13 years 10 months ago
1992
Springer
abstract Rafail Ostrovskyy Ramarathnam Venkatesanz Moti Yungx Secure commitment is a primitive enabling information hiding, which is one of the most basic tools in cryptography. S...