It's the other way around. Translating a problem with a known complexity class t... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

Daimanta on April 30, 2024 | parent | context | favorite | on: P vs. NP and the Computational Complexity Zoo (201...

It's the other way around. Translating a problem with a known complexity class to the new problem(in time P) indicates the complexity class.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact