NP-completeness for all computer science undergraduates
F LoboAndrea, R BaligaGanesh · Journal of computing sciences in colleges · 2006
It is widely recognized that there are some aspects of intractability and computational complexity that every CS professional should understand and be able to apply. NP-completeness is one of these...