1. Social media powered by reading.

    The best way to find, read and share articles online.

    App Store BadgeChrome Web Store Badge
    Coming soon to Android, Firefox, Safari and Edge. Get notified.
    Smithsonian | Elizabeth Landau | 3/9/20 | 9 min
    2 reads2 comments
    10
    Smithsonian
    2 reads
    10
    PadlockYou must read the article before you can post or reply.
    • deephdave
      Top reader this weekReading streakScout
      2 weeks ago

      If P=NP, then it’s possible to solve every problem whose solutions are easy to verify, says Stephens-Davidowitz. So, if this inequality persists, the general knapsack problem will always be hard.

    • vunderkind
      ScoutScribe
      2 weeks ago

      Knapsack problems are tricky. First time I read the traveling salesman problem, I didn't expect it to have a time complexity of polynomial time.

      Need to brush up my study into quantum computing.