DIMACS Challenge II.  UPDATE December 3, 1992.

Dear Participants,

This note announces changes and additions to papers available for
anonymous ftp at dimacs.rutgers.edu.  Other than updates of previously
announced material, we also have a new set of papers and codes for
generating and solving hard satisfiability problems, provided by Bart
Selman of AT&T Bell Laboratories.  There is some introductory material
on satisfiability, including problem definitions, suggested readings,
and a list of possible projects.

In a few days, I will send out instructions for those of you who are
interested in submitting a short summary of the work you are doing or
hope to do in the next year.  These summaries will be reviewed by the
Committee, will help me decide what support to provide, and will, with
author's permission, be available for ftp for others to see the
different projects underway.  I will get back to you on that in a week
or so.  The due date for the summaries will be January 15, 1993.

Thanks for your interest!

                                    Mike Trick
                                    Challenge Coordinator


The following additions and changes have been made (all in the
directory pub/challenge at dimacs.rutgers.edu)

1) graph/doc/ccreview.bib:  corrected typos and added references
2) graph/doc/ccreview.tex:  a few additions on graph coloring
3) sat/: directory added (link to satisfiability)
4) sat/contributed/selman: method for generating random hard sat
problems; paper on a local search method for SAT.
5) graph/doc/ccformat.tex:  Standard modified to allow information on
embedding graphs and other parameters used to generate graphs
6) sat/doc/satreview.tex .dvi .ps: Problem definitions, suggested
readings, list of suggested projects.