AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Satisfiability Problem: Theory and Applications
About this Title
Dingzhu Du, University of Minnesota, Minneapolis, MN, Jun Gu, University of Calgary, Calgary, AB, Canada and Panos M. Pardalos, University of Florida, Gainesville, FL, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
1997; Volume 35
ISBNs: 978-0-8218-0479-7 (print); 978-1-4704-3993-4 (online)
DOI: https://doi.org/10.1090/dimacs/035
MathSciNet review: MR1602746
MSC: Primary 68-06; Secondary 00B25, 03B05, 03D15, 68Q15, 68Q25, 68T15, 90C27
ReadershipTable of Contents
Front/Back Matter
Chapters
- Finding hard instances of the satisfiability problem: A survey
- Algorithms for the satisfiability (SAT) problem: A survey
- Backtracking and probing
- Relative size of certain polynomial time solvable subclasses of satisfiability
- Complexity of hierarchically and 1-dimensional periodically specified problems. I: Hardness results
- Worst-case analysis, 3-SAT decision, and lower bounds: Approaches for improved SAT algorithms
- Satisfiability of 3CNF formulas with small clause/variable-ratio
- Propositional search efficiency and first-order theorem proving
- Branching rules for propositional satisfiability test
- A discrete Lagrangian-based global-search method for solving satisfiability problems
- Approximate solution of weighted MAX-SAT problems using GRASP
- Multispace search for satisfiability and NP-hard problems
- A branch and cut algorithm for MAX-SAT and weighted MAX-SAT
- Surrogate constraint analysis—new heuristics and learning schemes for satisfiability problems
- A general stochastic approach to solving problems with hard and soft constraints
- Some fundamental properties of Boolean ring normal forms
- The polynomial time decidability of simulation relations for finite state processes: A HORNSAT based approach
- A better upper bound for the unsatisfiability threshold
- Solving MAX-SAT with nonoblivious functions and history-based heuristics
- On the imbalance of distributions of solutions of CNF formulas and its impact on satisfiability solvers
- On the use of second order derivatives for the satisfiability problem
- Local search for channel assignment in cellular mobile networks
- A GRASP clustering technique for circuit partitioning