The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Applied Mathematics
2005, volume: 149, number: 1-3

  1. 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]
  2. 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]
  3. David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin
    Supermodular functions and the complexity of MAX CSP. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:149, n:1-3, pp:53-72 [Journal]
  4. Thomas W. Cusick, Yuan Li
    k-th order symmetric SAC boolean functions and bisecting binomial coefficients. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:149, n:1-3, pp:73-86 [Journal]
  5. Alain Faye, Quoc-an Trinh
    A polyhedral approach for a constrained quadratic 0-1 problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:149, n:1-3, pp:87-100 [Journal]
  6. Hamed Hatami, Hossein Maserrat
    On the computational complexity of defining sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:149, n:1-3, pp:101-110 [Journal]
  7. Thomas Jansen, Ingo Wegener
    Real royal road functions--where crossover provably is essential. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:149, n:1-3, pp:111-125 [Journal]
  8. 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]
  9. Aviad Mintz, Martin Charles Golumbic
    Factoring Boolean functions using graph partitioning. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:149, n:1-3, pp:131-153 [Journal]
  10. Baruch Schieber, Daniel Geist, Ayal Zaks
    Computing the minimum DNF representation of Boolean functions defined by intervals. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:149, n:1-3, pp:154-173 [Journal]
  11. 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]
  12. 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]
  13. 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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002