Jan C. Bioch The complexity of modular decomposition of Boolean functions. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:149, n:1-3, pp:1-13 [Journal]

Ondrej Cepek, Petr Kucera Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:149, n:1-3, pp:14-52 [Journal]

Petr Kucera On the size of maximum renamable Horn sub-CNF. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:149, n:1-3, pp:126-130 [Journal]

Marcel Wild The many benefits of putting stack filters into disjunctive or conjunctive normal form. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:149, n:1-3, pp:174-191 [Journal]

Wenjun Xiao Linear symmetries of Boolean functions. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:149, n:1-3, pp:192-199 [Journal]

Igor E. Zverovich Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:149, n:1-3, pp:200-218 [Journal]

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP