Charles Explorer logo
🇬🇧

A subclass of Horn CNFs optimally compressible in polynomial time

Publication at Faculty of Mathematics and Physics |
2010

Abstract

We define a new class of Horn functions properly containing both of known polynomial classes and design a polynomial time HM algorithm for this new class.