Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.68187DBLPconf/sat/2003OpenAlexW2494235144MaRDI QIDQ5325847FDOQ5325847

Authors: Hubie Chen 

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

Recommendations

• A Better Algorithm for Random k-SAT
• A better algorithm for random \(k\)-SAT
• scientific article; zbMATH DE number 2083805
• scientific article; zbMATH DE number 1256700
• Probabilistic performance of a heurisic for the satisfiability problem

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 (3)

• A Better Algorithm for Random k-SAT
• An algorithm for random signed 3-SAT with intervals
• A better algorithm for random \(k\)-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 Q5325847)