3 ms·
A problem being NP hard doesn't mean that humans are competitive against computers. I'd like to see you solve SAT instances faster than cryptominisat, or do lin
by adrianN 11y ago
A problem being NP hard doesn't mean that humans are competitive against computers. I'd like to see you solve SAT instances faster than cryptominisat, or do linear optimization better than Gurobi.