What P vs NP is actually about

Name: What P vs NP is actually about
Uploaded: 2024-08-19T00:00:00.000Z
Duration: 17 min 57 s
Description: P vs NP is ultimately about whether efficient algorithms can be inverted — if SAT could be solved in polynomial time, any efficiently verifiable problem could also be solved efficiently by running its checker backwards.

Polylog · 17:57 · Watch on YouTube

P vs NP is ultimately about whether efficient algorithms can be inverted — if SAT could be solved in polynomial time, any efficiently verifiable problem could also be solved efficiently by running its checker backwards.

Read the full summary on retube

한국어