Charles Explorer logo
🇬🇧

Tractability conditions for classes of CNFs and their influence on the complexity of CNF minimization

Publication at Faculty of Mathematics and Physics |
2014

Abstract

The paper describes some tractability conditions for classes of CNFs and their influence on the computational and algorithmic complexity of CNF minimization within these classes