Gayathri Namasivayam, Miroslaw Truszczynski. Simple but Hard Mixed Horn Formulas. In Ofer Strichman, Stefan Szeider, editors, Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings. Volume 6175 of Lecture Notes in Computer Science, pages 382-387, Springer, 2010. [doi]
@inproceedings{NamasivayamT10, title = {Simple but Hard Mixed Horn Formulas}, author = {Gayathri Namasivayam and Miroslaw Truszczynski}, year = {2010}, doi = {10.1007/978-3-642-14186-7_36}, url = {http://dx.doi.org/10.1007/978-3-642-14186-7_36}, researchr = {https://researchr.org/publication/NamasivayamT10}, cites = {0}, citedby = {0}, pages = {382-387}, booktitle = {Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings}, editor = {Ofer Strichman and Stefan Szeider}, volume = {6175}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-14185-0}, }