Pages that link to "Item:Q1861908"
From MaRDI portal
The following pages link to An overview of backtrack search satisfiability algorithms (Q1861908):
Displaying 21 items.
- Finding kernels or solving SAT (Q414435) (← links)
- An exercise in transformational programming: Backtracking and Branch-and- Bound (Q808723) (← links)
- Heuristic-based backtracking relaxation for propositional satisfiability (Q862398) (← links)
- Satisfiability-based algorithms for Boolean optimization (Q1430296) (← links)
- Backtracking tactics in the backtrack method for SAT (Q1596804) (← links)
- Efficient data structures for backtrack search SAT solvers (Q1777399) (← links)
- Incomplete dynamic backtracking for linear pseudo-Boolean problems (Q1876529) (← links)
- Amortized random backtracking (Q1876532) (← links)
- Resolution versus search: Two strategies for SAT (Q1977760) (← links)
- Partition search for non-binary constraint satisfaction (Q2372239) (← links)
- A unified framework for DPLL(T) + certificates (Q2375732) (← links)
- Random backtracking in backtrack search algorithms for satisfiability (Q2643305) (← links)
- Resolution versus search: Two strategies for SAT (Q2749860) (← links)
- Optimal implementation of watched literals and more general techniques (Q2859022) (← links)
- Partial Backtracking in CDCL Solvers (Q2870149) (← links)
- Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning (Q3502713) (← links)
- A sufficient condition for backtrack-bounded search (Q3771663) (← links)
- (Q4012185) (← links)
- Quantum-walk speedup of backtracking algorithms (Q4612479) (← links)
- Progress in Artificial Intelligence (Q5191554) (← links)
- The Complexity of Propositional Proofs (Q5444711) (← links)
