Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Bruno Zanuttini:

TR05-119 | 15th September 2005
Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini

Preferred representations of Boolean relations

We introduce the notion of a plain basis for a co-clone in Post's lattice. Such a basis is a set of relations B such that every constraint C over a relation in the co-clone is logically equivalent to a conjunction of equalities and constraints over B and the same variables ... more >>>

ISSN 1433-8092 | Imprint