ISO-690 (author-date, English)

BRAVERMAN, Mark, 2011. Poly-logarithmic Independence Fools Bounded-Depth Boolean Circuits. Communications of the ACM. 1 April 2011. Vol. 54, no. 4, p. 108-115. DOI 10.1145/1924421.1924446.

Elsevier - Harvard (with titles)

Braverman, M., 2011. Poly-logarithmic Independence Fools Bounded-Depth Boolean Circuits. Communications of the ACM 54, 108-115. https://doi.org/10.1145/1924421.1924446

American Psychological Association 7th edition

Braverman, M. (2011). Poly-logarithmic Independence Fools Bounded-Depth Boolean Circuits. Communications of the ACM, 54(4), 108-115. https://doi.org/10.1145/1924421.1924446

Springer - Basic (author-date)

Braverman M (2011) Poly-logarithmic Independence Fools Bounded-Depth Boolean Circuits.. Communications of the ACM 54:108-115. https://doi.org/10.1145/1924421.1924446

Juristische Zitierweise (Stüber) (Deutsch)

Braverman, Mark, Poly-logarithmic Independence Fools Bounded-Depth Boolean Circuits., Communications of the ACM 2011, 108-115.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.