#ladner (1975) on the structure of polynomial time reducibility
Explore tagged Tumblr posts
Text
TIL: If P ≠ NP, then there must be decision problems that are neither polynomial-time solvable nor NP-complete.
#math#ladner (1975) on the structure of polynomial time reducibility#it's so funny to write 'Today I Learned' for a subject i should have learned in class in october
8 notes
·
View notes