Hacker News new | ask | show | jobs
by WCSTombs 85 days ago
This is a shockingly low-effort attempt even for a crackpot math paper. They attempt a "reduction" from SAT to 2-SAT, but it's very easy to see that the "reduced" 2-SAT instance does not preserve the satisfiability of the original formula, and in fact, it is always satisfiable as long as the input didn't include its own 2-literal clauses.