1379 search results - page 120 / 276 » The Complexity of the Annihilating Polynomial |
156
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
150
click to vote
ICC
2007
IEEE
16 years 23 days 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...
186
click to vote
EUROCRYPT
2004
Springer
15 years 11 months 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...
179
click to vote
WDAG
2007
Springer
16 years 16 days 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 ...
189
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...