Discrete Applied Mathematics 1999: Vol 96-97 Table of Contents PDF
Preview Discrete Applied Mathematics 1999: Vol 96-97 Table of Contents
DISCRETE APPLIED MATHEMATICS Double Volume 96—97, 15 October 1999 Contents The Satisfiability Problem Preface R. Battiti and M. Protasi Reactive local search techniques for the maximum k-conjunctive constraint satisfaction problem (MAX-k-CCSP) E. Boros Maximum renamable Horn sub-CNFs N. Creignou and H. Daude Satisfiability threshold for random XOR-CNF formulas T. Eiter, T. Ibaraaknid K. Makino Bidual Horn functions and extensions J. Franco, J. Goldsmith, J. Schlipf, E. Speckenmeyer and R.P. Swaminathan An algorithm for the class of pure implicational formulas A. Goerat A remark on random 2-SAT J. Gu The Multi-SAT algorithm P. Heusch The complexity of the falsifiability problem for pure implicational formulas H.K. Biining and T. Lettmann Resolution remains hard under equivalence O. Kullmann On a generalization of extended resolution A. Urquhart The symmetry rule in propositional logic A. Van Gelder Complexity analysis of propositional resolution with autarky pruning H. van Maaren Elliptic approximations of propositional formulae Boolean Functions Preface M. Anthony Accuracy of techniques for the logical analysis of data C. Benzaken From logical gates synthesis to chromatic bicritical clutters J.C. Bioch, T. Ibaraki and K. Makino Minimum self-dual decompositions of positive dual-minor Boolean functions S.Y. Chiu, L.A. Cox Jr. and X. Sun Optimal sequential inspections of reliability systems subject to parallel-chain precedence constraints O. Ekin, P.L. Hammer and A. Kogan On connected Boolean functions V. Gurvich and L. Khachiyan On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions P. Hansen, B. Jaumard and G.-B.D. Nguetse Best second order bounds for two-terminal network reliability with dependent edge failures J.N. Hooker and M.A. Osorio Mixed logical linear programming K. Makino and T. Ibaraki Inner-core and outer-core functions of partially defined Boolean functions H. Wolkowicz and Q. Zhao Semidefinite programming relaxations for the graph partitioning problem Author Index
The list of books you might like
