Comment

Comment by arcastroe

Ah, should've double checked before posting. Thank you everyone who corrected me. Leaving it up for others.

> SAT is an NP-complete problem, meaning that it is at least as hard as any other problem in NP

I think this statement is backwards. Instead, any other problem in NP is at least as hard as SAT

parent arcastroe 2 years ago

Discussion

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton