APA-Zitierstil (7. Ausg.)

Itsykson, D. (2014). Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms. Theory of computing systems, 54(2), 261-276. https://doi.org/10.1007/s00224-013-9514-8

Chicago-Zitierstil (17. Ausg.)

Itsykson, Dmitry. "Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms." Theory of Computing Systems 54, no. 2 (2014): 261-276. https://doi.org/10.1007/s00224-013-9514-8.

MLA-Zitierstil (9. Ausg.)

Itsykson, Dmitry. "Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms." Theory of Computing Systems, vol. 54, no. 2, 2014, pp. 261-276, https://doi.org/10.1007/s00224-013-9514-8.