Abstract is missing.
- Finding hard instances of the satisfiability problem: A surveyStephen A. Cook, David G. Mitchell. 1-18
- Algorithms for the satisfiability (SAT) problem: A surveyJun Gu, Paul W. Purdom, John Franco, Benjamin W. Wah. 19-152
- Backtracking and probingPaul Walton Purdom Jr., G. Neil Haven. 153-210
- Relative size of certain polynomial time solvable subclasses of satisfiabilityJohn Franco. 211-224
- Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness resultsMadhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan. 225-260
- Satisfiability of 3CNF formulas with small clause/variable-ratioKazuo Iwama, Kazuya Takaki. 315-334
- Propositional search efficiency and first-order theorem provingDavid A. Plaisted, Geoffrey D. Alexander. 335-350
- Branching rules for propositional satisfiability testJinchang Wang. 351-364
- A discrete Lagrangian-based global-search method for solving satisfiability problemsBenjamin Wan-Sang Wah, Yi Shang. 365-392
- Approximate solution of weighted MAX-SAT problems using GRASPMauricio G. C. Resende, Leonidas S. Pitsoulis, Panos M. Pardalos. 393-406
- Multispace search for satisfiability and NP-hard problemsJun Gu. 407-518
- A branch and cut algorithm for MAX-SAT and weighted MAX-SATSteve Joy, John E. Mitchell 0001, Brian Borchers. 519-536
- Surrogate constraint analysis-new heuristics and learning schemes for satisfiability problemsArne Løkketangen, Fred Glover. 537-572
- A general stochastic approach to solving problems with hard and soft constraintsHenry A. Kautz, Bart Selman, YueYen Jiang. 573-586
- Some fundamental properties of Boolean ring normal formsJieh Hsiang, Guan-Shieng Huang. 587-602
- The polynomial time decidability of simulation relations for finite processes: A HORNSAT based approachSandeep K. Shukla, Daniel J. Rosenkrantz, Harry B. Hunt III, Richard Edwin Stearns. 603-642
- A better upper bound for the unsatisfiability thresholdLefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc. 643-648
- Solving MAX-SAT with non-oblivious functions and history-based heuristicsRoberto Battiti, Marco Protasi. 649-668
- On the imbalance of distributions of solutions of CNF-formulas and its impact on satisfiability solversEwald Speckenmeyer, Max Böhm, Peter Heusch. 669-676
- On the use of second order derivatives for the satisfiability problemHans van Maaren. 677-688
- Local search for channel assignment in cellular mobile networksCraig K. Rushforth, Wei Wang. 689-710
- A GRASP clustering technique for circuit partitioningShawki Areibi, Anthony Vannelli. 711