Discrete Applied Mathematics

Editorial Board
pp. v-vii(3)

Contents
pp. viii-ix(2)

Preface
pp. 83-84(2)
Author: van Maaren H.

Approximating minimal unsatisfiable subformulae by means of adaptive core search
pp. 85-100(16)
Author: Bruni R.

How to fake an RSA signature by encoding modular root finding as a SAT problem
pp. 101-127(27)
Authors: Fiorini C.; Martinelli E.; Massacci F.

On good algorithms for determining unsatisfiability of propositional formulas
pp. 129-138(10)
Authors: Franco J.; Swaminathan R.

Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
pp. 139-155(17)
Authors: Gramm J.; Hirsch E.A.; Niedermeier R.; Rossmanith P.

Resolution and binary decision diagrams cannot simulate each other polynomially
pp. 157-171(15)
Authors: Groote J.F.; Zantema H.

Worst-case study of local search for MAX-k-SAT
pp. 173-184(12)
Author: Hirsch E.A.

On the structure of some classes of minimal unsatisfiable formulas
pp. 185-207(23)
Authors: Kleine Buning H.; Zhao X.

Lean clause-sets: generalizations of minimally unsatisfiable clause-sets
pp. 209-249(41)
Author: Kullmann O.

Equivalent literal propagation in the DLL procedure
pp. 251-276(26)
Author: Li C.-M.

On the limit of branching rules for hard random unsatisfiable 3-SAT
pp. 277-290(14)
Authors: Li C.-M.; Gerard S.

A satisfiability procedure for quantified Boolean formulae
pp. 291-328(38)
Authors: Plaisted D.A.; Biere A.; Zhu Y.

SAT problems with chains of dependent variables
pp. 329-350(22)
Author: Prestwich S.

Homomorphisms of conjunctive normal forms
pp. 351-365(15)
Author: Szeider S.