default search action
Search dblp for Publications
export results for "toc:db/journals/dam/dam96.bht:"
@article{DBLP:journals/dam/Anthony99, author = {Martin Anthony}, title = {Accuracy of Techniques for the Logical Analysis of Data}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {247--257}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00094-3}, doi = {10.1016/S0166-218X(99)00094-3}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/Anthony99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BattitiP99, author = {Roberto Battiti and Marco Protasi}, title = {Reactive Local Search Techniques for the Maximum k-conjunctive Constraint Satisfaction Problem (MAX-k-CCSP)}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {3--27}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00030-X}, doi = {10.1016/S0166-218X(99)00030-X}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/BattitiP99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Benzaken99, author = {Claude Benzaken}, title = {From Logical Gates Synthesis to Chromatic Bicritical Clutters}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {259--305}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00095-5}, doi = {10.1016/S0166-218X(99)00095-5}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Benzaken99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BiochIM99, author = {Jan C. Bioch and Toshihide Ibaraki and Kazuhisa Makino}, title = {Minimum Self-dual Decompositions of Positive Dual-minor Boolean Functions}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {307--326}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00096-7}, doi = {10.1016/S0166-218X(99)00096-7}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BiochIM99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Boros99, author = {Endre Boros}, title = {Maximum Renamable Horn sub-CNFs}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {29--40}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00031-1}, doi = {10.1016/S0166-218X(99)00031-1}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Boros99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BuningL99, author = {Hans Kleine{ }B{\"{u}}ning and Theodor Lettmann}, title = {Resolution Remains Hard Under Equivalence}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {139--148}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00055-4}, doi = {10.1016/S0166-218X(99)00055-4}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BuningL99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/ChiuCS99, author = {Steve Y. Chiu and Louis Anthony Cox Jr. and Xiaorong Sun}, title = {Optimal Sequential Inspections of Reliability Systems Subject to Parallel-chain Precedence Constraints}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {327--336}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00097-9}, doi = {10.1016/S0166-218X(99)00097-9}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/ChiuCS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/CreignouD99, author = {Nadia Creignou and Herv{\'{e}} Daud{\'{e}}}, title = {Satisfiability Threshold for Random {XOR-CNF} Formulas}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {41--53}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00032-3}, doi = {10.1016/S0166-218X(99)00032-3}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/CreignouD99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/EiterIM99, author = {Thomas Eiter and Toshihide Ibaraki and Kazuhisa Makino}, title = {Bidual Horn Functions and Extensions}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {55--88}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00033-5}, doi = {10.1016/S0166-218X(99)00033-5}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/EiterIM99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/EkinHK99, author = {Oya Ekin and Peter L. Hammer and Alexander Kogan}, title = {On Connected Boolean Functions}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {337--362}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00098-0}, doi = {10.1016/S0166-218X(99)00098-0}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/EkinHK99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/FrancoGSSS99, author = {John V. Franco and Judy Goldsmith and John S. Schlipf and Ewald Speckenmeyer and Ramjee P. Swaminathan}, title = {An Algorithm for the Class of Pure Implicational Formulas}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {89--106}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00038-4}, doi = {10.1016/S0166-218X(99)00038-4}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/FrancoGSSS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Gelder99, author = {Allen Van Gelder}, title = {Complexity Analysis of Propositional Resolution with Autarky Pruning}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {195--221}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00040-2}, doi = {10.1016/S0166-218X(99)00040-2}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Gelder99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Goerdt99, author = {Andreas Goerdt}, title = {A Remark on Random 2-SAT}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {107--110}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00034-7}, doi = {10.1016/S0166-218X(99)00034-7}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Goerdt99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Gu99, author = {Jun Gu}, title = {The Multi-SAT Algorithm}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {111--126}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00035-9}, doi = {10.1016/S0166-218X(99)00035-9}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Gu99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GurvichK99, author = {Vladimir Gurvich and Leonid Khachiyan}, title = {On Generating the Irredundant Conjunctive and Disjunctive Normal Forms of Monotone Boolean Functions}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {363--373}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00099-2}, doi = {10.1016/S0166-218X(99)00099-2}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GurvichK99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/HansenJN99, author = {Pierre Hansen and Brigitte Jaumard and Guy{-}Blaise Douanya Nguets{\'{e}}}, title = {Best Second Order Bounds for Two-terminal Network Reliability with Dependent Edge Failures}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {375--393}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00116-X}, doi = {10.1016/S0166-218X(99)00116-X}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/HansenJN99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Heusch99, author = {Peter Heusch}, title = {The Complexity of the Falsifiability Problem for Pure Implicational Formulas}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {127--138}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00036-0}, doi = {10.1016/S0166-218X(99)00036-0}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Heusch99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/HookerO99, author = {John N. Hooker and Mar{\'{\i}}a Auxilio Osorio Lama}, title = {Mixed Logical-linear Programming}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {395--442}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00100-6}, doi = {10.1016/S0166-218X(99)00100-6}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/HookerO99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Kullmann99, author = {Oliver Kullmann}, title = {On a Generalization of Extended Resolution}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {149--176}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00037-2}, doi = {10.1016/S0166-218X(99)00037-2}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Kullmann99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Maaren99, author = {Hans van Maaren}, title = {Elliptic Approximations of Propositional Formulae}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {223--244}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00041-4}, doi = {10.1016/S0166-218X(99)00041-4}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Maaren99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/MakinoI99, author = {Kazuhisa Makino and Toshihide Ibaraki}, title = {Inner-core and Outer-core Functions of Partially Defined Boolean Functions}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {443--460}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00101-8}, doi = {10.1016/S0166-218X(99)00101-8}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/MakinoI99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Urquhart99, author = {Alasdair Urquhart}, title = {The Symmetry Rule in Propositional Logic}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {177--193}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00039-6}, doi = {10.1016/S0166-218X(99)00039-6}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Urquhart99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/WolkowiczZ99, author = {Henry Wolkowicz and Qing Zhao}, title = {Semidefinite Programming Relaxations for the Graph Partitioning Problem}, journal = {Discret. Appl. Math.}, volume = {96-97}, pages = {461--479}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00102-X}, doi = {10.1016/S0166-218X(99)00102-X}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/WolkowiczZ99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.