B. Chor and O. Goldreich, "Unbiased bits from weak sources of randomness and probabilistic communication complexity", SIAM J. on Comput., Vol. 17, No. 2, pp. 230--261, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Quantum Entanglement and the Communication Complexity.. - Cleve, van Dam.. (1998) (27 citations) (Correct)
.... inputs and deterministic errorless protocols, the communication complexity is n and, for randomized protocols (with either an independent or a shared random source) uniformly distributed or worst case inputs, and with error probability 1 2 required, the communication complexity is n O(log(1= [7] (see also [13] In 1993, Yao [17] introduced a variation of the above classical communication complexity scenarios, where the parties communicate with qubits , rather than with bits. Protocols in this model are at least as powerful as probabilistic protocols with independent random sources. ....
B. Chor and O. Goldreich, \Unbiased bits from weak sources of randomness and probabilistic communication complexity", SIAM J. on Comput., Vol. 17, No. 2, pp. 230-261, 1988.
Quantum Entanglement and the Communication Complexity.. - Cleve, van Dam.. (1998) (27 citations) (Correct)
.... deterministic errorless protocols, the communication complexity is n and, for randomized protocols (with either an independent or a shared random source) uniformly distributed or worst case inputs, and with error probability 1 2 # required, the communication complexity is n O(log(1 #) [7] (see also [13] In 1993, Yao [17] introduced a variation of the above classical communication complexity scenarios, where the parties communicate with qubits,rather than with bits. Protocols in this model are at least as powerful as probabilistic protocols with independent random sources. ....
B. Chor and O. Goldreich, "Unbiased bits from weak sources of randomness and probabilistic communication complexity", SIAM J. on Comput., Vol. 17, No. 2, pp. 230--261, 1988.
Quantum Entanglement and the Communication Complexity.. - Cleve, van Dam.. (1998) (27 citations) (Correct)
.... errorless protocols, the communication complexity is n and, for randomized protocols (with either an independent or a shared random source) uniformly distributed or worst case inputs, and with error probability 1 2 Gamma ffi required, the communication complexity is n Gamma O(log(1=ffi) [7] (see also [13] In 1993, Yao [17] introduced a variation of the above classical communication complexity scenarios, where the parties communicate with qubits , rather than with bits. Protocols in this model are at least as powerful as probabilistic protocols with independent random sources. ....
B. Chor and O. Goldreich, "Unbiased bits from weak sources of randomness and probabilistic communication complexity", SIAM J. on Comput., Vol. 17, No. 2, pp. 230--261, 1988.
Quantum Entanglement and the Communication Complexity of the .. - Richard Cleve Wim (Correct)
No context found.
B. Chor and O. Goldreich, "Unbiased bits from weak sources of randomness and probabilistic communication complexity", SIAM J. on Comput., Vol. 17, No. 2, pp. 230--261, 1988.
quant-ph/9708019 - Mar Quantum Entanglement (Correct)
No context found.
B. Chor and O. Goldreich, "Unbiased bits from weak sources of randomness and probabilistic communication complexity", SIAM J. on Comput., Vol. 17, No. 2, pp. 230--261, 1988.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC