Matt Rickard
Subscribe
Sign in
Hard to Compute, Simple to Verify
Sep 25, 2022
NP-complete problems, assuming P ≠ NP, have solutions that are hard to compute but simple to verify.
Read →
Comments
This site requires JavaScript to run correctly. Please
turn on JavaScript
or unblock scripts
Hard to Compute, Simple to Verify
NP-complete problems, assuming P ≠ NP, have solutions that are hard to compute but simple to verify.