


default search action
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 - Endre Boros

:
Maximum Renamable Horn sub-CNFs. 29-40 - Nadia Creignou, Hervé Daudé:

Satisfiability Threshold for Random XOR-CNF Formulas. 41-53 - Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:

Bidual Horn Functions and Extensions. 55-88 - John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan:

An Algorithm for the Class of Pure Implicational Formulas. 89-106 - Andreas Goerdt:

A Remark on Random 2-SAT. 107-110 - Jun Gu:

The Multi-SAT Algorithm. 111-126 - Peter Heusch:

The Complexity of the Falsifiability Problem for Pure Implicational Formulas. 127-138 - Hans Kleine Büning, Theodor Lettmann:

Resolution Remains Hard Under Equivalence. 139-148 - Oliver Kullmann:

On a Generalization of Extended Resolution. 149-176 - Alasdair Urquhart:

The Symmetry Rule in Propositional Logic. 177-193 - Allen Van Gelder:

Complexity Analysis of Propositional Resolution with Autarky Pruning. 195-221 - Hans van Maaren:

Elliptic Approximations of Propositional Formulae. 223-244 - Martin Anthony

:
Accuracy of Techniques for the Logical Analysis of Data. 247-257 - Claude Benzaken:

From Logical Gates Synthesis to Chromatic Bicritical Clutters. 259-305 - Jan C. Bioch, Toshihide Ibaraki, Kazuhisa Makino:

Minimum Self-dual Decompositions of Positive Dual-minor Boolean Functions. 307-326 - Steve Y. Chiu, Louis Anthony Cox Jr., Xiaorong Sun:

Optimal Sequential Inspections of Reliability Systems Subject to Parallel-chain Precedence Constraints. 327-336 - Oya Ekin, Peter L. Hammer, Alexander Kogan:

On Connected Boolean Functions. 337-362 - Vladimir Gurvich, Leonid Khachiyan:

On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions. 363-373 - Pierre Hansen, Brigitte Jaumard, Guy-Blaise Douanya Nguetsé:

Best Second Order Bounds for Two-terminal Network Reliability with Dependent Edge Failures. 375-393 - John N. Hooker, María Auxilio Osorio Lama:

Mixed Logical-linear Programming. 395-442 - Kazuhisa Makino, Toshihide Ibaraki:

Inner-core and Outer-core Functions of Partially Defined Boolean Functions. 443-460 - Henry Wolkowicz, Qing Zhao:

Semidefinite Programming Relaxations for the Graph Partitioning Problem. 461-479

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














