Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on A proof P = NP was accidentally published in TOCT. Parent comment
NP is the class of problems that can be solved in polynomial time by a non-deterministic automaton.
NP is the class of problems that can be solved in polynomial time by a non-deterministic automaton.