An Interactive Tutorial for NP-Completeness
A Theory of Algorithms course is essential to any Computer Science curriculum at both the undergraduate and graduate levels. It is also considered to be difficult material to teach or to learn. In particular the topics of Computational Complexity Theory, reductions, and the NP-Complete class of prob...
Main Author: | Maji, Nabanita |
---|---|
Other Authors: | Computer Science |
Format: | Others |
Published: |
Virginia Tech
2015
|
Subjects: | |
Online Access: | http://hdl.handle.net/10919/52973 |
Similar Items
-
Towards the Solution of NP Complete Problems
by: Amit Kumar, et al.
Published: (2010-01-01) -
A Modified Heuristic Procedure for NP-Complete Problems Supported by Genetic Algorithms
by: Najla Al-Saati
Published: (2004-05-01) -
Algorithmes exacts et exponentiels pour les problèmes NP-difficiles : domination, variantes et généralisations
by: Liedloff, Mathieu
Published: (2007) -
The INDEPENDENT SET Decision Problem is NP-complete
by: Bristow, Andrew, IV
Published: (2011) -
Ising formulations of many NP problems
by: Andrew eLucas
Published: (2014-02-01)