scientific article; zbMATH DE number 5139164

MaRDI QIDQ3429157zbMATH OpenFDO

Authors Oliver Kullmann

Publication date 30 March 2007

zbMATH Keywords

phase transitionrandom satisfiability problemsthreshold behaviour

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Random 2-SAT: Results and problems
• scientific article; zbMATH DE number 69384
• scientific article; zbMATH DE number 2010170
• Solving the satisfiability problem by using randomized approach
• An efficient approach to solving random \(k\)-SAT problems
• An exact and a randomized approach for the satisfiability problem
• A Stochastic Limit Approach to the SAT Problem
• Solving non-uniform planted and filtered random SAT formulas greedily
• The SAT-UNSAT transition for random constraint satisfaction problems
• Strategies for Solving SAT in Grids by Randomized Search

Cited in

(6)

• Visualizing SAT instances and runs of the DPLL algorithm
• Careful ranking of multiple solvers with timeouts and ties
• SAT race 2015
• Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3429157)