NP-hard problems but only for n≥3 Posted by Mark Dominus, at cs.stackexchange.com, 15 Nov 2019 2-SAT is in P; 3-SAT is NP-complete. Exact cover by 2-sets is in P; exact cover by 3-sets is NP-complete Two-dimensional…