Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Aritanan Gruber, Endre Boros. Hardness Results for Approximate Pure Horn CNF Formulae Minimization. In International Symposium on Artificial Intelligence and Mathematics (ISAIM 2012), Fort Lauderdale, Florida, USA, January 9-11, 2012. 2012. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Hardness results for approximate pure Horn CNF formulae minimizationEndre Boros, Aritanan Gruber. AMAI, 71(4):327-363, 2014. [doi] A combinatorial min-max theorem and minimization of pure-Horn functionsEndre Boros, Ondrej Cepek, Kazuhisa Makino. isaim 2016: [doi] Maximum Renamable Horn sub-CNFsEndre Boros. DAM, 96-97:29-40, 1999. [doi]
The following publications are possibly variants of this publication: