Title of article
On the Boolean connectivity problem for Horn relations Original Research Article
Author/Authors
Kazuhisa Makino، نويسنده , , Suguru Tamaki، نويسنده , , Masaki Yamamoto، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
7
From page
2024
To page
2030
Abstract
Gopalan et al. studied in [P. Gopalan, P.G. Kolaitis, E.N. Maneva, C.H. Papadimitriou, The connectivity of Boolean satisfiability: computational and structural dichotomies, in: Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006, 2006, pp. 346–357] and [P. Gopalan, P.G. Kolaitis, E.N. Maneva, C.H. Papadimitrio
Keywords
Horn relations , Schaefer’s framework , Boolean connectivity
Journal title
Discrete Applied Mathematics
Serial Year
2010
Journal title
Discrete Applied Mathematics
Record number
887530
Link To Document