104 search results - page 7 / 21 » The Partition Bound for Classical Communication Complexity a... |
127
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
132
click to vote
ECCC
2008
15 years 3 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
133
Voted
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
135
click to vote
ASIACRYPT
2001
Springer
15 years 8 months ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
125
Voted
ALT
2006
Springer
16 years 10 days ago
2006
Springer
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...