1 Table of Contents: “... Strategies for Quantified Boolean Formulas -- Solving Error Correction for Large Data Sets by Means of a SAT...”

2 Table of Contents: “...Complexity Theory and Non-determinism -- Parameterized Complexity Theory -- Fpt-Reducibility to SAT...”

3 Table of Contents: “... Convolution -- Local Search and SAT -- Split and List -- Time Versus Space -- Miscellaneous -- Conclusions...”

4 Table of Contents: “... for Combinatorial Optimization Problems -- Frequency Assignment Problems -- Algorithms for the Satisfiability (SAT...”

5 Table of Contents: “... computing systems -- Parallel algorithms for satisfiability (SAT) testing -- Sequential and parallel branch...”

6 Table of Contents: “... Switching Functions Using Peptide-Antibody Interactions -- Plasmids to Solve #3SAT -- Communicating...”

7 Table of Contents: “...Parity Constrained k-Edge-Connected Orientations -- Approximation Algorithms for MAX 4-SAT...”

8 Table of Contents: “... for MAX-SAT -- Connections between Nonlinear Programming and Discrete Optimization -- Interior Point...”

9 Table of Contents: “... Polynomials Are Identical -- B.1.4 Randomized Rounding Applied to MaxSAT -- B.1.5 Primality Testing -- B.1.6...”

10 Table of Contents: “... -- Binary Arithmetic for DNA Computers -- Implementation of a Random Walk Method for Solving 3-SAT...”

11 Table of Contents: “... for MAX 3SAT -- Steiner Trees -- The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum...”

12 Table of Contents: “... -- A Short Proof of Euler–Poincaré Formula -- Approximate MDS Property of Linear Codes -- A SAT attack...”