Ablayev, F. (1996). Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theoretical computer science, 157(2), 139-159. https://doi.org/10.1016/0304-3975(95)00157-3
Citácia podle Chicago (17th ed.)Ablayev, Farid. "Lower Bounds for One-way Probabilistic Communication Complexity and Their Application to Space Complexity." Theoretical Computer Science 157, no. 2 (1996): 139-159. https://doi.org/10.1016/0304-3975(95)00157-3.
Citácia podľa MLA (8th ed.)Ablayev, Farid. "Lower Bounds for One-way Probabilistic Communication Complexity and Their Application to Space Complexity." Theoretical Computer Science, vol. 157, no. 2, 1996, pp. 139-159, https://doi.org/10.1016/0304-3975(95)00157-3.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..