STACS
1999
Springer
13 years 12 months ago
1999
Springer
We show that the marked version of the Post Correspondence Problem, where the words on a list are required to di er in the rst letter, is decidable. On the other hand, PCP remains ...
STACS
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
STACS
1999
Springer
13 years 12 months ago
1999
Springer
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the ...
STACS
1999
Springer
13 years 12 months ago
1999
Springer
STACS
1999
Springer
13 years 12 months ago
1999
Springer
Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identification). His machine, on t...
STACS
1999
Springer
13 years 12 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 12 months ago
1999
Springer
This paper presents a completeness result for a first-order interval temporal logic, called Neighbourhood Logic (NL) which has two neighbourhood modalities. NL can support the spe...
STACS
1999
Springer
13 years 12 months ago
1999
Springer
SPIN
1999
Springer
13 years 12 months ago
1999
Springer
Operator procedures are documents telling operators what to do in various situations. They are widely used in process industries including the nuclear power industry. The correctne...
SPIN
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. We describe a translation from a dialect of SDL-88 to PROMELA, the input language of the SPIN model checker. The fairly straightforward translation covers data types as w...