Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.68183OpenAlexW2494235144MaRDI QIDQ5325857FDOQ5325857

Rainer Schuler, Sven Baumer

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)

Cited In (8)

• PPSZ is better than you think
• STACS 2005
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms for four variants of the exact satisfiability problem
• Derandomizing the HSSW algorithm for 3-SAT
• AI 2003: Advances in Artificial Intelligence
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• A probabilistic algorithm for \(k\)-SAT based on limited local search and restart 👍 👎
• Title not available (Why is that?) 👍 👎
• Solving satisfiability in less than \(2^ n\) steps 👍 👎
• Randomized algorithms 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)