Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > ZDENEK DVORÁK:
All reports by Author Zdenek Dvorák:

TR04-051 | 10th June 2004
Zdenek Dvorák, Daniel Král, Ondrej Pangrác

Locally consistent constraint satisfaction problems

An instance of a constraint satisfaction problem is $l$-consistent
if any $l$ constraints of it can be simultaneously satisfied.
For a set $\Pi$ of constraint types, $\rho_l(\Pi)$ denotes the largest ratio of constraints which can be satisfied in any $l$-consistent instance composed by constraints from the set $\Pi$. In the ... more >>>




ISSN 1433-8092 | Imprint