The complexity of gradient descent: CLS = PPAD ∩ PLS

Slični predmeti

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