Theory and Applications of Satisfiability Testing

DOI10.1007/B95238MaRDI QIDQ5325857zbMATH OpenOpenAlexFDO

Authors Sven Baumer, Rainer Schuler

Publication date 24 July 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b95238

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 2086385
• A probabilistic algorithm for k-SAT based on limited local search and restart
• scientific article; zbMATH DE number 515744
• Solving satisfiability in less than \(2^ n\) steps
• Randomized algorithms for 3-SAT

Cited in

(13)

• Randomized algorithms for 3-SAT
• A new approach on solving 3-satisfiability
• PPSZ is better than you think
• scientific article; zbMATH DE number 1848397 (Why is no real title available?)
• STACS 2005
• scientific article; zbMATH DE number 515744 (Why is no real title available?)
• $O(1.890^n)$ exact algorithm for a class of separable SAT problems
• Algorithms for four variants of the exact satisfiability problem
• Exploiting partial knowledge of satisfying assignments
• Improved polynomial algorithm for 3-SAT
• AI 2003: Advances in Artificial Intelligence
• scientific article; zbMATH DE number 2086385 (Why is no real title available?)
• Guided Search and a Faster Deterministic Algorithm for 3-SAT

This page was built for publication: Theory and Applications of Satisfiability Testing

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