Page mothballed [August 20, 2008]: Page skeleton
remains from Spring 2008 course offering at Dorsey Center. Syllabus
posted is that for Spring 2008 for student reference. All other links
to class material either inactive or not maintained until next class
offering.
NP-Completeness (backup materials for reference and class
discussion)
"Guarded Commands, Nondeterminacy and Formal Derivation of
Programs", Edsger W. Dijkstra, Communications of the ACM, Vol
18, No 8, August 1975, pp 453- 457.
A
compendium of NP optimization problems, Editors: Pierluigi
Crescenzi, piluc@dsi.unifi.it and Viggo Kann,
viggo@nada.kth.se. Subeditors: Magnús
Halldórsson (Graph Theory -- Covering and Partitioning,
Subgraphs and Supergraphs, Sets and Partitions) Marek
Karpinski (Graph Theory -- Vertex Ordering, Network Design --
Cuts and Connectivity) Gerhard Woeginger (Sequencing and
Scheduling)
The
P vs NP Problem, A Millennium Prize Problem, Clay
Mathematics Institute (Solution award $1 Million Dollars)
ResearchIndex, The NECI Scientific Literature Digital
Library
Very Large Data Base
Endowment Inc., "(VLDB Endowment) is non-profit
organisation incorporated in the United States for the sole
purpose of promoting and exchanging scholarly work in
databases and related fields throughout the world".