#### computer-science 5

View all

Advent of Code 2020 - Solutions in racket
Proving the set-covering problem is NP-complete (using reduction from the vertex cover problem)
How to show a problem is NP-complete
Proving 0-1 integer programming is NP-complete (using reduction from 3-CNF-SAT)
Proving set-partition problem is NP-complete (using reduction from subset sum)