Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on On Norbert Blum’s claimed proof that P does not equal NP. Parent comment
All these classes would turn out to be the same since P is closed under complement. Then NP would be as well and everything is equal.
That's why this result sometimes is called the collapse if the complexity hierarchy.
There are no comments on this comment yet.
All these classes would turn out to be the same since P is closed under complement. Then NP would be as well and everything is equal.
That's why this result sometimes is called the collapse if the complexity hierarchy.