Kyle Polich avatar

Dexa/Kyle Polich

Learn more

Exponential Query Complexity

Kyle and John discuss the challenges of efficiently solving functions with exponential query complexity, highlighting the need for exponentially many queries to achieve even slight improvements in approximation accuracy.
  • In this clip

  • From this podcast

    Data Skeptic avatar

    Data Skeptic

    The Complexity of Learning Neural Networks

  • Related Questions

    • Can mathematics solve complex problems as discussed in the episode Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111 and the clip Solving the Hamiltonian Circuit?

    • Can mathematics solve complex problems as discussed in the episode Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111 and the clip Graphs and Complexity?

    • Can mathematics solve complex problems as discussed in the episode Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111 and the clip Randomized Algorithms?

Built by
Charlie AI
© 2024 Kyle PolichTermsPrivacySupport