642 search results - page 38 / 129 » corr 2006 |
82
Voted
CORR
2006
Springer
15 years 14 days ago
2006
Springer
There has been a great deal of work on characterizing the complexity of the satisfiability and validity problem for modal logics. In particular, Ladner showed that the consistency...
72
Voted
CORR
2006
Springer
15 years 14 days ago
2006
Springer
We perform forward error analysis for a large class of recursive matrix multiplication algorithms in the spirit of [D. Bini and G. Lotti, Stability of fast algorithms for matrix m...
117
Voted
CORR
2006
Springer
15 years 14 days ago
2006
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been ...
78
Voted
CORR
2006
Springer
15 years 14 days ago
2006
Springer
Our theme bases on the classical Hanoi Towers Problem. In this paper we will define a new problem, permitting some positions, that were not legal in the classical problem. Our goa...
CORR
2006
Springer
15 years 14 days ago
2006
Springer
We consider the general relay channel. For this setup, the best achievability result was derived by Cover and ElGamal, in theorem 6 of their paper from 1979. In this work we apply...