An exact and a randomized approach for the satisfiability problem
From MaRDI portal
Recommendations
Cited in
(22)- Solving the satisfiability problem by using randomized approach
- An efficient algorithm for the 3-satisfiability problem
- Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
- A new algorithm for the propositional satisfiability problem
- The SAT+CAS method for combinatorial search with applications to best matrices
- A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
- Stochastic systematic search algorithms for satisfiability
- scientific article; zbMATH DE number 1696808 (Why is no real title available?)
- Probabilistic analysis of satisfiability algorithms
- An approximative inference method for solving ∃∀SO satisfiability problems
- scientific article; zbMATH DE number 5139164 (Why is no real title available?)
- Strong Refutation Heuristics for Random k-SAT
- Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem
- scientific article; zbMATH DE number 30299 (Why is no real title available?)
- scientific article; zbMATH DE number 515744 (Why is no real title available?)
- scientific article; zbMATH DE number 1738648 (Why is no real title available?)
- scientific article; zbMATH DE number 1929945 (Why is no real title available?)
- Absorbing random walks and the NAE2SAT problem
- Mathematical Foundations of Computer Science 2005
- A randomized satisfiability procedure for arithmetic and uninterpreted function symbols.
- Algorithms for four variants of the exact satisfiability problem
- A dual algorithm for the satisfiability problem
This page was built for publication: An exact and a randomized approach for the satisfiability problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2747196)
