#ladner (1975) on the structure of polynomial time reducibility
Explore tagged Tumblr posts
bubbloquacious · 2 years ago
Text
TIL: If P ≠ NP, then there must be decision problems that are neither polynomial-time solvable nor NP-complete.
8 notes · View notes