Discrete Applied Mathematics

Disjunctive and conjunctive normal forms of pseudo-Boolean functions
pp. 1-26(26)
Authors: Foldes S.; Hammer P.L.

On the relations between SAT and CSP enumerative algorithms
pp. 27-40(14)
Authors: Genisson R.; Jegou P.

Approximating a generalization of MAX 2SAT and MIN 2SAT
pp. 41-59(19)
Authors: Hochbaum¹ D.S.; Pathria A.

General lower bounds on the query complexity within the exact learning model
pp. 61-81(21)
Authors: Klasner N.; Simon H.U.

On subclasses of minimal unsatisfiable formulas
pp. 83-98(16)
Author: Buning H.

Investigations on autark assignments
pp. 99-137(39)
Author: Kullmann¹ O.

The influence of variables on pseudo-Boolean functions with applications to game theory and multicriteria decision making
pp. 139-164(26)
Author: Marichal J.-L.

Polyhedral structure of submodular and posi-modular systems
pp. 165-189(25)
Authors: Nagamochi H.; Ibaraki T.

Hardness of identifying the minimum ordered binary decision diagram
pp. 191-201(11)
Authors: Takenaga Y.; Yajima S.

Trading properties and Alexandrov kernels for Boolean functions
pp. 203-214(12)
Authors: Taylor A.D.; Zwicker W.S.

Reflectiveness and compression of threshold transformations
pp. 215-224(10)
Author: Ueda T.

Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT
pp. 225-239(15)
Authors: van Maaren H.; Warners¹ J.P.

Solving satisfiability problems using elliptic approximations - effective branching rules
pp. 241-259(19)
Authors: Warners¹ J.P.; van Maaren H.