• Riven@sh.itjust.works
    link
    fedilink
    arrow-up
    3
    ·
    1 year ago

    Specifically I think they’re talking about the subclass of np problems called “np complete” that are functionally identical to each other in some mathy way such that solving one of them instantly gives you a method to solve all of them.

    • Barbacamanitu@lemmy.world
      link
      fedilink
      arrow-up
      1
      ·
      1 year ago

      Is it only no complete? Or does this include np-hard? I just posted a comment about this and thought it applied to np-hard.