default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDIMACS Workshop: Satisfiability Problem: Theory and Applications 1996
- Ding-Zhu Du, Jun Gu, Panos M. Pardalos:
Satisfiability Problem: Theory and Applications, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, March 11-13, 1996. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 35, DIMACS/AMS 1997, ISBN 978-0-8218-0479-7 - Foreword. Satisfiability Problem: Theory and Applications 1996: xiii-
- Preface. Satisfiability Problem: Theory and Applications 1996: xv-
- Stephen A. Cook, David G. Mitchell:
Finding hard instances of the satisfiability problem: A survey. 1-17 - Jun Gu, Paul W. Purdom, John V. Franco, Benjamin W. Wah:
Algorithms for the satisfiability (SAT) problem: A survey. 19-151 - Paul Walton Purdom Jr., G. Neil Haven:
Backtracking and probing. 153-209 - John Franco:
Relative size of certain polynomial time solvable subclasses of satisfiability. 211-223 - Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan:
Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results. 225-259 - Oliver Kullman:
Worst-case analysis, 3-SAT decision and lower bounds: Approaches for improved SAT algorithms. 261-313 - Kazuo Iwama, Kazuya Takaki:
Satisfiability of 3CNF formulas with small clause/variable-ratio. 315-333 - David A. Plaisted, Geoffrey D. Alexander:
Propositional search efficiency and first-order theorem proving. 335-350 - Jinchang Wang:
Branching rules for propositional satisfiability test. 351-364 - Benjamin Wan-Sang Wah, Yi Shang:
A discrete Lagrangian-based global-search method for solving satisfiability problems. 365-392 - Mauricio G. C. Resende, Leonidas S. Pitsoulis, Panos M. Pardalos:
Approximate solution of weighted MAX-SAT problems using GRASP. 393-405 - Jun Gu:
Multispace search for satisfiability and NP-hard problems. 407-517 - Steve Joy, John E. Mitchell, Brian Borchers:
A branch and cut algorithm for MAX-SAT and weighted MAX-SAT. 519-536 - Arne Løkketangen, Fred W. Glover:
Surrogate constraint analysis-new heuristics and learning schemes for satisfiability problems. 537-572 - Henry A. Kautz, Bart Selman, YueYen Jiang:
A general stochastic approach to solving problems with hard and soft constraints. 573-585 - Jieh Hsiang, Guan-Shieng Huang:
Some fundamental properties of Boolean ring normal forms. 587-602 - Sandeep K. Shukla, Daniel J. Rosenkrantz, Harry B. Hunt III, Richard Edwin Stearns:
The polynomial time decidability of simulation relations for finite processes: A HORNSAT based approach. 603-641 - Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc:
A better upper bound for the unsatisfiability threshold. 643-648 - Roberto Battiti, Marco Protasi:
Solving MAX-SAT with non-oblivious functions and history-based heuristics. 649-667 - Ewald Speckenmeyer, Max Böhm, Peter Heusch:
On the imbalance of distributions of solutions of CNF-formulas and its impact on satisfiability solvers. 669-676 - Hans van Maaren:
On the use of second order derivatives for the satisfiability problem. 677-687 - Craig K. Rushforth, Wei Wang:
Local search for channel assignment in cellular mobile networks. 689-709 - Shawki Areibi, Anthony Vannelli:
A GRASP clustering technique for circuit partitioning. 711-724
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.
last updated on 2026-04-26 00:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
