29908 search results - page 103 / 5982 » On the Complexity of |
151
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
For an nt transmit, nr receive antenna system (nt
142
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
: We prove that coNP MA in the number-on-forehead model of multiparty communication complexity for up to k = (1 - )logn players, where > 0 is any constant. Specifically, we con...
145
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
135
click to vote
DCG
2006
15 years 6 months ago
2006
We introduce a new encoding of the face numbers of a simplicial complex, its Stirling polynomial, that has a simple expression obtained by multiplying each face number with an app...
181
click to vote
IJWET
2008
15 years 6 months ago
2008
: Data warehousing and Online Analytical Processing (OLAP) technologies are now moving onto handling complex data that mostly originate from the web. However, integrating such data...