
On the Hat Guessing Number of Graphs
The hat guessing number HG(G) of a graph G on n vertices is defined in t...
read it

The maximum negative hypergeometric distribution
An urn contains a known number of balls of two different colors. We desc...
read it

Upper bounds on the average number of colors in the nonequivalent colorings of a graph
A coloring of a graph is an assignment of colors to its vertices such th...
read it

Consistent sets of lines with no colorful incidence
We consider incidences among colored sets of lines in R^d and examine wh...
read it

Faster algorithm for Unique (k,2)CSP
In a (k,2)Constraint Satisfaction Problem we are given a set of arbitra...
read it

An InformationTheoretical Approach to the Information Capacity and CostEffectiveness Evaluation of Color Palettes
Colors are used as effective tools of representing and transferring info...
read it

Nonparametric Data Analysis on the Space of Perceived Colors
Moving around in a 3D world, requires the visual system of a living indi...
read it
Impatient PPSZ – a Faster algorithm for CSP
PPSZ is the fastest known algorithm for (d,k)CSP problems, for most values of d and k. It goes through the variables in random order and sets each variable randomly to one of the d colors, excluding those colors that can be ruled out by looking at few constraints at a time. We propose and analyze a modification of PPSZ: whenever all but 2 colors can be ruled out for some variable, immediately set that variable randomly to one of the remaining colors. We show that our new "impatient PPSZ" outperforms PPSZ exponentially for all k and all d >= 3 on formulas with a unique satisfying assignment.
READ FULL TEXT
Comments
There are no comments yet.