Reduction-based MAX-3SAT with low nonlinearity and lattices under recombination
From MaRDI portal
Publication:6635982
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 1149448 (Why is no real title available?)
- scientific article; zbMATH DE number 956863 (Why is no real title available?)
- Combining Adaptive Noise and Look-Ahead in Local Search for SAT
- Compact quadratizations for pseudo-Boolean functions
- Critical Behavior in the Satisfiability of Random Boolean Expressions
- Decomposing SAT Instances with Pseudo Backbones
- Improving stochastic local search for SAT with a new probability distribution
- Partition Crossover can Linearize Local Optima Lattices of k-bounded Pseudo-Boolean Functions
- Partition Crossover for Pseudo-Boolean Optimization
- Pseudo-Boolean optimization
- Survey propagation: An algorithm for satisfiability
- Theory and Applications of Satisfiability Testing
This page was built for publication: Reduction-based MAX-3SAT with low nonlinearity and lattices under recombination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635982)