ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > KEYWORD > HORN:
Reports tagged with Horn:
TR07-029 | 20th January 2007
Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto

A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem

Revisions: 1
P. Gopalan, P. G. Kolaitis, E. N. Maneva and C. H. Papadimitriou studied in [Gopalan et al., ICALP2006] connectivity properties of the solution-space of Boolean formulas, and investigated complexity issues on connectivity problems in Schaefer's framework [Schaefer, STOC1978]. A set S of logical relations is Schaefer if all relations in ... more >>>



ISSN 1433-8092 | Imprint