1379 search results - page 91 / 276 » The Complexity of the Annihilating Polynomial |
187
click to vote
GLOBECOM
2007
IEEE
16 years 19 days ago
2007
IEEE
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
184
click to vote
FCT
2005
Springer
15 years 11 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
145
click to vote
CRYPTO
2004
Springer
15 years 11 months ago
2004
Springer
Recently proposed algebraic attacks [2, 6] and fast algebraic attacks [1, 5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exp...
177
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
177
click to vote
JACM
2010
15 years 4 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...