zlacker

[parent] [thread] 1 comments
1. dragon+(OP)[view] [source] 2025-05-21 20:39:32
The article is about a new proof wherein P == PSPACE.

Something we all intuitively expected but someone finally figured out an obscure way to prove it.

--------

This is a really roundabout article that takes a meandering path to a total bombshell in the field of complexity theory. Sorry for spoiling but uhhh, you'd expect an article about P == PSPACE would get to the point faster....

replies(1): >>LPisGo+T
2. LPisGo+T[view] [source] 2025-05-21 20:45:28
>>dragon+(OP)
This article is not about a proof that P = PSPACE. That would be way bigger news since it also directly implies P = NP.
[go to top]