
Journals in DBLP
 Hans van Maaren
Preface. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:8384 [Journal]
 Renato Bruni
Approximating minimal unsatisfiable subformulae by means of adaptive core search. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:85100 [Journal]
 Claudia Fiorini, Enrico Martinelli, Fabio Massacci
How to fake an RSA signature by encoding modular root finding as a SAT problem. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:101127 [Journal]
 John V. Franco, Ramjee P. Swaminathan
On good algorithms for determining unsatisfiability of propositional formulas. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:129138 [Journal]
 Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith
Worstcase upper bounds for MAX2SAT with an application to MAXCUT. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:139155 [Journal]
 Jan Friso Groote, Hans Zantema
Resolution and binary decision diagrams cannot simulate each other polynomially. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:157171 [Journal]
 Edward A. Hirsch
Worstcase study of local search for MAXkSAT. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:173184 [Journal]
 Hans Kleine Büning, Xishun Zhao
On the structure of some classes of minimal unsatisfiable formulas. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:185207 [Journal]
 Oliver Kullmann
Lean clausesets: generalizations of minimally unsatisfiable clausesets. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:209249 [Journal]
 Chu Min Li
Equivalent literal propagation in the DLL procedure. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:251276 [Journal]
 Chu Min Li, Sylvain Gérard
On the limit of branching rules for hard random unsatisfiable 3SAT. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:277290 [Journal]
 David A. Plaisted, Armin Biere, Yunshan Zhu
A satisfiability procedure for quantified Boolean formulae. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:291328 [Journal]
 Steven David Prestwich
SAT problems with chains of dependent variables. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:329350 [Journal]
 Stefan Szeider
Homomorphisms of conjunctive normal forms. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:351365 [Journal]
