Discrete Applied Mathematics

1

Preface

Hans van Maaren

Journal:

Year:

2003

Language:

english

File:

PDF, 60 KB

english, 2003

2

Approximating minimal unsatisfiable subformulae by means of adaptive core search

Renato Bruni

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 246 KB

english, 2003

3

How to fake an RSA signature by encoding modular root finding as a SAT problem

Claudia Fiorini, Enrico Martinelli, Fabio Massacci

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 848 KB

english, 2003

4

On good algorithms for determining unsatisfiability of propositional formulas

John Franco, Ram Swaminathan

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 234 KB

english, 2003

5

Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT

Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 215 KB

english, 2003

6

Resolution and binary decision diagrams cannot simulate each other polynomially

J.F. Groote, H. Zantema

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 200 KB

english, 2003

7

Worst-case study of local search for MAX-k-SAT

Edward A. Hirsch

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 171 KB

english, 2003

8

On the structure of some classes of minimal unsatisfiable formulas

Hans Kleine Büning, Xishun Zhao

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 262 KB

english, 2003

9

Lean clause-sets: generalizations of minimally unsatisfiable clause-sets

Oliver Kullmann

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 406 KB

english, 2003

10

Equivalent literal propagation in the DLL procedure

Chu-Min Li

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 1.05 MB

english, 2003

11

On the limit of branching rules for hard random unsatisfiable 3-SAT

Chu-Min Li, Sylvain Gérard

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 445 KB

english, 2003

12

A satisfiability procedure for quantified Boolean formulae

David A. Plaisted, Armin Biere, Yunshan Zhu

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 301 KB

english, 2003

13

SAT problems with chains of dependent variables

Steven Prestwich

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 207 KB

english, 2003

14

Homomorphisms of conjunctive normal forms

Stefan Szeider

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 253 KB

english, 2003

15

Guide for authors

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 143 KB

english, 2003

16

Editorial Board

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 88 KB

english, 2003

17

Volume 130; Issue 2

Preface

Approximating minimal unsatisfiable subformulae by means of adaptive core search

How to fake an RSA signature by encoding modular root finding as a SAT problem

On good algorithms for determining unsatisfiability of propositional formulas

Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT

Resolution and binary decision diagrams cannot simulate each other polynomially

Worst-case study of local search for MAX-k-SAT

On the structure of some classes of minimal unsatisfiable formulas

Lean clause-sets: generalizations of minimally unsatisfiable clause-sets

Equivalent literal propagation in the DLL procedure

On the limit of branching rules for hard random unsatisfiable 3-SAT

A satisfiability procedure for quantified Boolean formulae

SAT problems with chains of dependent variables

Homomorphisms of conjunctive normal forms

Guide for authors

Editorial Board

Contents