|
Journals in DBLP
- Hans van Maaren
Preface. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:83-84 [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:85-100 [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:101-127 [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:129-138 [Journal]
- Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:139-155 [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:157-171 [Journal]
- Edward A. Hirsch
Worst-case study of local search for MAX-k-SAT. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:173-184 [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:185-207 [Journal]
- Oliver Kullmann
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:209-249 [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:251-276 [Journal]
- Chu Min Li, Sylvain Gérard
On the limit of branching rules for hard random unsatisfiable 3-SAT. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:277-290 [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:291-328 [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:329-350 [Journal]
- Stefan Szeider
Homomorphisms of conjunctive normal forms. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:130, n:2, pp:351-365 [Journal]
|