Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with Constraint Propagation:
TR07-007 | 17th January 2007
Jan Krajicek

An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams

We prove an exponential lower bound on the size of proofs
in the proof system operating with ordered binary decision diagrams
introduced by Atserias, Kolaitis and Vardi. In fact, the lower bound
applies to semantic derivations operating with sets defined by OBDDs.
We do not assume ... more >>>

ISSN 1433-8092 | Imprint