Pages that link to "Item:Q513324"
From MaRDI portal
The following pages link to Improving configuration checking for satisfiable random \(k\)-SAT instances (Q513324):
Displaying 13 items.
- Local search for Boolean satisfiability with configuration checking and subscore (Q490437) (← links)
- Improving configuration checking for satisfiable random \(k\)-SAT instances (Q513324) (← links)
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem (Q1725596) (← links)
- Automated non-monotonic reasoning in System \textbf{P} (Q2043430) (← links)
- Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041) (← links)
- An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
- Local search for diversified top-\(k\) clique search problem (Q2289947) (← links)
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism (Q2680785) (← links)
- Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
- Recognizing More Unsatisfiable Random <i>k</i>-SAT Instances Efficiently (Q5470697) (← links)
- Verifiable Obtained Random Subsets for Improving SPHINCS+ (Q6488404) (← links)
