“If efficiently verifying a solution means we can also efficiently find one, why have we seen no practical evidence of it?
What if the complexity that separates P from NP is an inherent feature of computation itself?”
“If efficiently verifying a solution means we can also efficiently find one, why have we seen no practical evidence of it?
What if the complexity that separates P from NP is an inherent feature of computation itself?”