Fearnley, J., Goldberg, P., Hollender, A., & Savani, R. (2021). The complexity of gradient descent: CLS = PPAD ∩ PLS. Association for Computing Machinery.
Cita Chicago (17th ed.)Fearnley, J., P. Goldberg, A. Hollender, i R. Savani. The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. Association for Computing Machinery, 2021.
Cita MLA (9th ed.)Fearnley, J., et al. The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. Association for Computing Machinery, 2021.
Atenció: Aquestes cites poden no estar 100% correctes.