Fearnley, J., Goldberg, P., Hollender, A., & Savani, R. (2021). The complexity of gradient descent: CLS = PPAD ∩ PLS. Association for Computing Machinery.
Chicago Style (17th ed.) CitationFearnley, J., P. Goldberg, A. Hollender, and R. Savani. The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. Association for Computing Machinery, 2021.
ציטוט MLAFearnley, J., et al. The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. Association for Computing Machinery, 2021.
אזהרה: ציטוטים אלה לעיתים לא מדויקים ב 100%.