default search action
Discrete Applied Mathematics, Volume 142
Volume 142, Number 1-3, August 2004
- Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino:
Dual-bounded generating problems: weighted transversals of a hypergraph. 1-15 - Jianer Chen, Iyad A. Kanj:
Improved exact algorithms for MAX-SAT. 17-27 - Miguel Couceiro, Stephan Foldes:
Definability of Boolean function classes by linear equations over GF(2). 29-34 - Stephan Foldes, Grant R. Pogosyan:
Post classes characterized by functional terms. 35-51 - Stephan Foldes, Peter L. Hammer:
Disjunctive analogues of submodular and supermodular pseudo-Boolean functions. 53-65 - Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav:
Ordered binary decision diagrams and the Shannon effect. 67-85 - Frank K. Hwang, J. S. Lee, Uriel G. Rothblum:
Permutation polytopes corresponding to strongly supermodular functions. 87-97 - Lars Magnus Hvattum, Arne Løkketangen, Fred W. Glover:
Adaptive memory search for Boolean optimization problems. 99-109 - Sergei O. Kuznetsov:
Complexity of learning in concept lattices from positive and negative examples. 111-125 - Tianbing Xia, Jennifer Seberry, Josef Pieprzyk, Chris Charnes:
Homogeneous bent functions of degree n in 2n variables do not exist for nge3. 127-132 - Jiawei Zhang, Yinyu Ye, Qiaoming Han:
Improved approximations for max set splitting and max NAE SAT. 133-149 - Takashi Horiyama, Toshihide Ibaraki:
Reasoning with ordered binary decision diagrams. 151-163 - Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki:
A decomposability index in logical analysis of data. 165-180 - Rocco A. Servedio:
Monotone Boolean formulas can approximate monotone linear threshold functions. 181-187 - Tonguç Ünlüyurt:
Sequential testing of complex systems: a review. 189-205
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.