Recognition of tractable satisfiability problems through balanced polynomial representations
From MaRDI portal
Publication:1962045
DOI10.1016/S0166-218X(99)00135-3zbMath0943.68061WikidataQ126437746 ScholiaQ126437746MaRDI QIDQ1962045
Hans van Maaren, Joost P. Warners
Publication date: 20 March 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Solving satisfiability problems using elliptic approximations -- effective branching rules ⋮ A two-phase algorithm for solving a class of hard satisfiability problems
Uses Software
Cites Work
- Polynomially solvable satisfiability problems
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A two-phase algorithm for solving a class of hard satisfiability problems
- On renamable Horn and generalized Horn functions
- Solving satisfiability problems using elliptic approximations -- effective branching rules
- Elliptic approximations of propositional formulae
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Hard examples for resolution
- A Complexity Index for Satisfiability Problems
- Extended Horn sets in propositional logic
- The complexity of satisfiability problems
- The complexity of theorem-proving procedures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Recognition of tractable satisfiability problems through balanced polynomial representations
