Search Sciweavers | Sciweavers

29908 search results - page 3 / 5982

» On the complexity of communication complexity

click to vote

STOC
2007
ACM

84views Algorithms» more STOC 2007»

Lower bounds in communication complexity based on factorization norms

14 years 5 months ago

Download www.cs.huji.ac.il

We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....

Nati Linial, Adi Shraibman

claim paper

Read More »

click to vote

ICC
2007
IEEE

121views Communications» more ICC 2007»

On the Expected Complexity Analysis of a Generalized Sphere Decoding Algorithm for Underdetermined Linear Communication Systems

13 years 11 months ago

Download www.prism.uvsq.fr

This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...

Ping Wang, Tho Le-Ngoc

claim paper

Read More »

click to vote

AICT
2008
IEEE

103views Communications» more AICT 2008»

BER and Complexity Comparisons of the MPIC Receiver and the Linear Chip Equalizer

13 years 11 months ago