The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Applied Mathematics
2003, volume: 130, number: 2

  1. Hans van Maaren
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:2, pp:83-84 [Journal]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. Stefan Szeider
    Homomorphisms of conjunctive normal forms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:2, pp:351-365 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002