Tell, R. (2019). Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials. Computational complexity, 28(2), 259-343. https://doi.org/10.1007/s00037-019-00179-2
Chicago-Zitierstil (17. Ausg.)Tell, Roei. "Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials." Computational Complexity 28, no. 2 (2019): 259-343. https://doi.org/10.1007/s00037-019-00179-2.
MLA-Zitierstil (9. Ausg.)Tell, Roei. "Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials." Computational Complexity, vol. 28, no. 2, 2019, pp. 259-343, https://doi.org/10.1007/s00037-019-00179-2.
Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.