Sciweavers

29908 search results - page 79 / 5982
» On the complexity of communication complexity
Sort
View
TCOM
2010
61views more  TCOM 2010»
13 years 8 months ago
Variable-rate M-PSK communications without channel amplitude estimation
—Channel estimation at the receiver side is essential to adaptive modulation schemes, prohibiting low complexity systems from using variable rate and/or variable power transmissi...
Athanasios S. Lioumpas, George K. Karagiannidis
DM
2007
101views more  DM 2007»
13 years 10 months ago
Threshold graphs, shifted complexes, and graphical complexes
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the inde...
Caroline J. Klivans
COCO
2009
Springer
119views Algorithms» more  COCO 2009»
14 years 4 months ago
An Approximation Algorithm for Approximation Rank
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
Troy Lee, Adi Shraibman
COMPLEX
2009
Springer
14 years 4 months ago
Characterizing the Structural Complexity of Real-World Complex Networks
Although recent research has shown that the complexity of a network depends on its structural organization, which is linked to the functional constraints the network must satisfy, ...
Jun Wang, Gregory M. Provan
TCS
2002
13 years 9 months ago
Complexity measures and decision tree complexity: a survey
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
Harry Buhrman, Ronald de Wolf