Pages that link to "Item:Q5714764"
From MaRDI portal
The following pages link to Theory and Applications of Satisfiability Testing (Q5714764):
Displaying 23 items.
- UBCSAT (Q15153) (← links)
- New local search methods for partial MaxSAT (Q329035) (← links)
- Simulating circuit-level simplifications on CNF (Q352967) (← links)
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\) (Q400514) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- Global versus local search: the impact of population sizes on evolutionary algorithm performance (Q727394) (← links)
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem (Q1725596) (← links)
- Improved haplotype assembly using Xor genotypes (Q1784030) (← links)
- Probabilistic characterization of random Max \(r\)-Sat (Q2042075) (← links)
- Cooperative parallel SAT local search with path relinking (Q2057122) (← links)
- Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results (Q2216123) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- SATenstein: automatically building local search SAT solvers from components (Q2634473) (← links)
- The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$ (Q2818001) (← links)
- Captain Jack: New Variable Selection Heuristics in Local Search for SAT (Q3007692) (← links)
- Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT (Q3172891) (← links)
- Decomposing SAT Instances with Pseudo Backbones (Q3304190) (← links)
- Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning (Q3502713) (← links)
- Efficiently Calculating Evolutionary Tree Measures Using SAT (Q3637154) (← links)
- Breaking Cycle Structure to Improve Lower Bound for Max-SAT (Q4632177) (← links)
- ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver (Q5015596) (← links)