Discrete Applied Mathematics, Volume 149

Volume 149, Number 1-3, August 2005

• Jan C. Bioch:
  The complexity of modular decomposition of Boolean functions. 1-13
  
• Ondrej Cepek, Petr Kucera:
  Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing. 14-52
  
• David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
  Supermodular functions and the complexity of MAX CSP. 53-72
  
• Thomas W. Cusick, Yuan Li:
  k-th order symmetric SAC boolean functions and bisecting binomial coefficients. 73-86
  
• Alain Faye, Quoc-an Trinh:
  A polyhedral approach for a constrained quadratic 0-1 problem. 87-100
  
• Hamed Hatami, Hossein Maserrat:
  On the computational complexity of defining sets. 101-110
  
• Thomas Jansen, Ingo Wegener:
  Real royal road functions--where crossover provably is essential. 111-125
  
• Petr Kucera:
  On the size of maximum renamable Horn sub-CNF. 126-130
  
• Aviad Mintz, Martin Charles Golumbic:
  Factoring Boolean functions using graph partitioning. 131-153
  
• Baruch Schieber, Daniel Geist, Ayal Zaks:
  Computing the minimum DNF representation of Boolean functions defined by intervals. 154-173
  
• Marcel Wild:
  The many benefits of putting stack filters into disjunctive or conjunctive normal form. 174-191
  
• Wenjun Xiao:
  Linear symmetries of Boolean functions. 192-199
  
• Igor E. Zverovich:
  Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes. 200-218