Skip to content

other

P vs. NP

Open problem in computational complexity theory asking whether every problem whose solution can be verified quickly can also be solved quickly; one of the Clay Mathematics Institute's Millennium Prize Problems.

Known aliases

  • P versus NP

Relationships

No evidence-backed relationships are recorded.

Current clusters