Discrete Applied Mathematics, Volume 96

Volume 96-97, October 1999

• Roberto Battiti, Marco Protasi:
  Reactive Local Search Techniques for the Maximum k-conjunctive Constraint Satisfaction Problem (MAX-k-CCSP). 3-27
  Electronic Edition (link) BibTeX
• Endre Boros:
  Maximum Renamable Horn sub-CNFs. 29-40
  Electronic Edition (link) BibTeX
• Nadia Creignou, Hervé Daudé:
  Satisfiability Threshold for Random XOR-CNF Formulas. 41-53
  Electronic Edition (link) BibTeX
• Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
  Bidual Horn Functions and Extensions. 55-88
  Electronic Edition (link) BibTeX
• John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan:
  An Algorithm for the Class of Pure Implicational Formulas. 89-106
  Electronic Edition (link) BibTeX
• Andreas Goerdt:
  A Remark on Random 2-SAT. 107-110
  Electronic Edition (link) BibTeX
• Jun Gu:
  The Multi-SAT Algorithm. 111-126
  Electronic Edition (link) BibTeX
• Peter Heusch:
  The Complexity of the Falsifiability Problem for Pure Implicational Formulas. 127-138
  Electronic Edition (link) BibTeX
• Hans Kleine Büning, Theodor Lettmann:
  Resolution Remains Hard Under Equivalence. 139-148
  Electronic Edition (link) BibTeX
• Oliver Kullmann:
  On a Generalization of Extended Resolution. 149-176
  Electronic Edition (link) BibTeX
• Alasdair Urquhart:
  The Symmetry Rule in Propositional Logic. 177-193
  Electronic Edition (link) BibTeX
• Allen Van Gelder:
  Complexity Analysis of Propositional Resolution with Autarky Pruning. 195-221
  Electronic Edition (link) BibTeX
• Hans van Maaren:
  Elliptic Approximations of Propositional Formulae. 223-244
  Electronic Edition (link) BibTeX
• Martin Anthony:
  Accuracy of Techniques for the Logical Analysis of Data. 247-257
  Electronic Edition (link) BibTeX
• Claude Benzaken:
  From Logical Gates Synthesis to Chromatic Bicritical Clutters. 259-305
  Electronic Edition (link) BibTeX
• Jan C. Bioch, Toshihide Ibaraki, Kazuhisa Makino:
  Minimum Self-dual Decompositions of Positive Dual-minor Boolean Functions. 307-326
  Electronic Edition (link) BibTeX
• Steve Y. Chiu, Louis Anthony Cox Jr., Xiaorong Sun:
  Optimal Sequential Inspections of Reliability Systems Subject to Parallel-chain Precedence Constraints. 327-336
  Electronic Edition (link) BibTeX
• Oya Ekin, Peter L. Hammer, Alexander Kogan:
  On Connected Boolean Functions. 337-362
  Electronic Edition (link) BibTeX
• Vladimir Gurvich, Leonid Khachiyan:
  On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions. 363-373
  Electronic Edition (link) BibTeX
• Pierre Hansen, Brigitte Jaumard, Guy-Blaise Douanya Nguetsé:
  Best Second Order Bounds for Two-terminal Network Reliability with Dependent Edge Failures. 375-393
  Electronic Edition (link) BibTeX
• John N. Hooker, María Auxilio Osorio Lama:
  Mixed Logical-linear Programming. 395-442
  Electronic Edition (link) BibTeX
• Kazuhisa Makino, Toshihide Ibaraki:
  Inner-core and Outer-core Functions of Partially Defined Boolean Functions. 443-460
  Electronic Edition (link) BibTeX
• Henry Wolkowicz, Qing Zhao:
  Semidefinite Programming Relaxations for the Graph Partitioning Problem. 461-479
  Electronic Edition (link) BibTeX