Roberto Battiti, Marco Protasi Reactive Local Search Techniques for the Maximum k-conjunctive Constraint Satisfaction Problem (MAX-k-CCSP). [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:96, n:, pp:3-27 [Journal]
Jun Gu The Multi-SAT Algorithm. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:96, n:, pp:111-126 [Journal]
Peter Heusch The Complexity of the Falsifiability Problem for Pure Implicational Formulas. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:96, n:, pp:127-138 [Journal]
Allen Van Gelder Complexity Analysis of Propositional Resolution with Autarky Pruning. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:96, n:, pp:195-221 [Journal]
Hans van Maaren Elliptic Approximations of Propositional Formulae. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:96, n:, pp:223-244 [Journal]
Martin Anthony Accuracy of Techniques for the Logical Analysis of Data. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:96, n:, pp:247-257 [Journal]
Claude Benzaken From Logical Gates Synthesis to Chromatic Bicritical Clutters. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:96, n:, pp:259-305 [Journal]
Vladimir Gurvich, Leonid Khachiyan On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:96, n:, pp:363-373 [Journal]