scientific article; zbMATH DE number 1114003
From MaRDI portal
Publication:4375770
zbMath0889.68074MaRDI QIDQ4375770
Brian Borchers, Steve Joy, John E. Mitchell
Publication date: 2 June 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Classical propositional logic (03B05)
Related Items (14)
Probabilistic logic with independence ⋮ An LPCC approach to nonconvex quadratic programs ⋮ Solving the weighted MAX-SAT problem using the dynamic convexized method ⋮ An efficient solver for weighted Max-SAT ⋮ MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability ⋮ Exact MAX-2SAT solution via lift-and-project closure ⋮ 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 ⋮ Evaluating the impact of AND/OR search on 0-1 integer linear programming ⋮ Semidefinite Programming and Constraint Programming ⋮ A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem ⋮ Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT ⋮ ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver
This page was built for publication:
