Frank Vega
Posted on
A proof that P = NP by demonstrating that MONOTONE-MIN-3SAT, a variant of the satisfiability problem, is both NP-complete and solvable in polynomial time.
For further actions, you may consider blocking this person and/or reporting abuse
Top comments (0)