Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
chazisop
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
37 ms
·
1.
▲
by
chazisop
11y ago
> For all we know, some problems in P could be so difficult as to preclude any practical algorithm. You can actually prove that given any (concrete) subclass of P that there is a language in both in P and harder, by a simple application