Theory and Applications of Satisfiability Testing

DOI10.1007/B137280zbMATH Open1128.68466OpenAlexW2497844642MaRDI QIDQ5713752FDOQ5713752

Authors: Marijn J. H. Heule, Hans van Maaren 

Publication date: 15 December 2005

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

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

Recommendations

• scientific article; zbMATH DE number 2083805
• A Complexity Index for Satisfiability Problems
• Bridging between 0/1 and linear programming via random walks
• Lower bounds for random 3-SAT via differential equations
• Phase transition for local search on planted SAT

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• The phase transition in 1-in-\(k\) SAT and NAE 3-SAT
• Bridging between 0/1 and linear programming via random walks

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 Q5713752)