Pages that link to "Item:Q2741510"
From MaRDI portal
The following pages link to Balance and filtering in structured satisfiable problems. (Preliminary report) (Q2741510):
Displaying 12 items.
- Simulating circuit-level simplifications on CNF (Q352967) (← links)
- The Sudoku completion problem with rectangular hole pattern is NP-complete (Q713152) (← links)
- The impact of search heuristics on heavy-tailed behaviour (Q850467) (← links)
- Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings (Q862408) (← links)
- Regular random \(k\)-SAT: Properties of balanced formulas (Q862410) (← links)
- On NP-hardness of the clique partition -- independence number gap recognition and related problems (Q2368935) (← links)
- Exploiting multivalued knowledge in variable selection heuristics for SAT solvers (Q2385440) (← links)
- Modelling and solving temporal reasoning as propositional satisfiability (Q2389682) (← links)
- Generalised arc consistency for the AllDifferent constraint: an empirical survey (Q2389692) (← links)
- A Bayesian approach to tackling hard computational problems. (Preliminary report) (Q2741540) (← links)
- On the Integration of Singleton Consistencies and Look-Ahead Heuristics (Q5302725) (← links)
- sgen1 (Q5406224) (← links)