Sciweavers

10988 search results - page 185 / 2198
» Algorithmic Folding Complexity
Sort
View
COCO
2001
Springer
154views Algorithms» more  COCO 2001»
15 years 8 months ago
Quantum Algorithms for Element Distinctness
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...
Harry Buhrman, Christoph Dürr, Mark Heiligman...
STOC
2001
ACM
129views Algorithms» more  STOC 2001»
16 years 3 months ago
Interaction in quantum communication and the complexity of set disjointness
One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet i...
Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David...
144
Voted
GLOBECOM
2008
IEEE
15 years 10 months ago
A Low-Complexity Iterative Channel Estimation and Detection Technique for Doubly Selective Channels
— In this paper, we propose a low-complexity iterative joint channel estimation, detection and decoding technique for doubly selective channels. The key is a segment-by-segment f...
Qinghua Guo, Ping Li
LICS
2007
IEEE
15 years 9 months ago
Light Logics and Optimal Reduction: Completeness and Complexity
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL ...
Patrick Baillot, Paolo Coppola, Ugo Dal Lago
129
Voted
WADS
2007
Springer
91views Algorithms» more  WADS 2007»
15 years 9 months ago
Kernelization and Complexity Results for Connectivity Augmentation Problems
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...
Jiong Guo, Johannes Uhlmann