The complexity of gradient descent: CLS = PPAD ∩ PLS

Eitemau Tebyg

• The complexity of gradient descent: CLS = PPAD∩PLS
  gan: Fearnley, J, et al.
  Cyhoeddwyd: (2022)
• Pure-Circuit: tight inapproximability for PPAD
  gan: Deligkas, A, et al.
  Cyhoeddwyd: (2024)
• Pure-circuit: strong inapproximability for PPAD
  gan: Deligkas, A, et al.
  Cyhoeddwyd: (2022)
• The Hairy Ball problem is PPAD-complete
  gan: Goldberg, P, et al.
  Cyhoeddwyd: (2019)
• The Hairy Ball problem is PPAD-complete
  gan: Goldberg, PW, et al.
  Cyhoeddwyd: (2021)