Ian Payne, Pure Mathematics, University of Waterloo
"Bounded Width and the Local Consistency Algorithm: Part 2"
This
talk
will
be
a
continuation
of
the
discussion
in
"part
1".
There
are
a
few
facts
and
definitions
left
to
state
before
the
local
consistency
algorithm
can
be
explained.
Once
this
is
all
done,
I
will
define
what
it
means
for
a
structure
to
have
bounded
width,
and
prove
that
such
structures
are
our
friends.
I'll
finish
off
with
a
nice
example.