366 search results - page 2 / 74 » Four equivalent equivalences of reductions |
MOR
2000
13 years 7 months ago
2000
This paper introduces four alternative representations of a set function: the M
ENTCS
2006
13 years 7 months ago
2006
In this paper, we study several linear-time equivalences (Markovian trace equivalence, failure and ready trace equivalence) for continuous-time Markov chains that refer to the pro...
FCT
2009
Springer
14 years 1 months ago
2009
Springer
We study the equivalence problem of deterministic nested word to word transducers and show it to be suprisingly robust. Modulo polynomal time reductions, it can be identified with...
ENTCS
2007
13 years 7 months ago
2007
We define an observational equivalence for Lafont’s interaction combinators, which we prove to be the least discriminating non-trivial congruence on total nets (nets admitting ...
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
Recently four non-iterative algorithms for simultaneous low rank approximations of matrices (SLRAM) have been presented by several researchers. In this paper, we show that those a...