Discrete Applied Mathematics, Volume 107

Volume 107, Number 1-3, December 2000

• Stephan Foldes, Peter L. Hammer: Disjunctive and conjunctive normal forms of pseudo-Boolean functions. 1-26
• Richard Génisson, Philippe Jégou: On the relations between SAT and CSP enumerative algorithms. 27-40
• Dorit S. Hochbaum, Anu Pathria: Approximating a generalization of MAX 2SAT and MIN 2SAT. 41-59
• Norbert Klasner, Hans-Ulrich Simon: General lower bounds on the query complexity within the exact learning model. 61-81
• Hans Kleine Büning: On subclasses of minimal unsatisfiable formulas. 83-98
• Oliver Kullmann: Investigations on autark assignments. 99-137
• Jean-Luc Marichal: The influence of variables on pseudo-Boolean functions with applications to game theory and multicriteria decision making. 139-164
• Hiroshi Nagamochi, Toshihide Ibaraki: Polyhedral structure of submodular and posi-modular systems. 165-189
• Yasuhiko Takenaga, Shuzo Yajima: Hardness of identifying the minimum ordered binary decision diagram. 191-201
• Alan D. Taylor, William S. Zwicker: Trading properties and Alexandrov kernels for Boolean functions. 203-214
• Takao Ueda: Reflectiveness and compression of threshold transformations. 215-224
• Hans van Maaren, Joost P. Warners: Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT. 225-239
• Joost P. Warners, Hans van Maaren: Solving satisfiability problems using elliptic approximations - effective branching rules. 241-259