This paper proposes one of the first scalable methods for estimating the number of clusters of solutions of graph coloring problems using a belief propagation like algorithm.

3 Views 0 Downloads

Concepts

clusters

Show More Show Less

Additional Tags

hypercubes, solution space, belief propagation, boolean formulas, cornell: counting solution clusters in graph coloring problems, kullback-leibler divergence, sign-alternation, sign-correspondence, f constraint satisfaction problems, factor graph, graph coloring

Show More Show Less

Classroom Considerations

This resource is only available on an unencrypted HTTP website.It should be fine for general use, but don’t use it to share any personally identifiable information

View 4,135 other resources for 11th - 12th Grade Algebra II