1383 search results - page 121 / 277 » On the Complexity of the Interlace Polynomial |
165
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper, the application of combinatorial geometry to noncoherent multiple–symbol differential detection (MSDD) is considered. The resulting algorithm is referred to as...
211
Voted
EUROCRYPT
2004
Springer
16 years 13 days ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
198
Voted
WDAG
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
165
click to vote
IJHPCA
2006
15 years 7 months ago
2006
In this paper we study the scheduling of multiple divisible loads on a star network of processors. We show that this problem is computationally hard. Special cases solvable in pol...
183
click to vote
ACTA
1998
15 years 6 months ago
1998
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...