Pages that link to "Item:Q1841892"
From MaRDI portal
The following pages link to Solving satisfiability problems using elliptic approximations -- effective branching rules (Q1841892):
Displaying 7 items.
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381) (← links)
- A SAT approach to query optimization in mediator systems (Q1777403) (← links)
- Investigations on autark assignments (Q1841885) (← links)
- A short note on some tractable cases of the satisfiability problem. (Q1854345) (← links)
- Solving satisfiability problems using elliptic approximations. A note on volumes and weights (Q1861906) (← links)
- Elliptic approximations of propositional formulae (Q1961455) (← links)
- Recognition of tractable satisfiability problems through balanced polynomial representations (Q1962045) (← links)