Pages that link to "Item:Q3587716"
From MaRDI portal
The following pages link to Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases (Q3587716):
Displaying 4 items.
- A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions (Q969776) (← links)
- 3BA: a border bases solver with a SAT extension (Q1662237) (← links)
- On conversions from CNF to ANF (Q2307626) (← links)
- The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study (Q3527696) (← links)