Publication:4375770
From MaRDI portal
zbMath0889.68074MaRDI QIDQ4375770
John E. Mitchell, Brian Borchers, Steve Joy
Publication date: 2 June 1998
68Q25: Analysis of algorithms and problem complexity
68W10: Parallel algorithms in computer science
03B05: Classical propositional logic
Related Items
An LPCC approach to nonconvex quadratic programs, Efficient branch-and-bound algorithms for weighted MAX-2-SAT, A framework for reasoning under uncertainty based on non-deterministic distance semantics, Simplified forms of computerized reasoning with distance semantics, A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem, An efficient solver for weighted Max-SAT, Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT, Evaluating the impact of AND/OR search on 0-1 integer linear programming, Probabilistic logic with independence, Solving the weighted MAX-SAT problem using the dynamic convexized method, MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability, Exact MAX-2SAT solution via lift-and-project closure, Semidefinite Programming and Constraint Programming