Theory and Applications of Satisfiability Testing

DOI10.1007/B95238MaRDI QIDQ5325862zbMATH OpenOpenAlexFDO

Authors G. Parisi

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)

Recommendations

• scientific article; zbMATH DE number 2083805
• Survey propagation: An algorithm for satisfiability
• Probabilistic performance of a heurisic for the satisfiability problem
• A probabilistic study on the satisfiability problem
• The decimation process in random \(k\)-SAT

Cited in

(11)

• scientific article; zbMATH DE number 2083805 (Why is no real title available?)
• Theory and Applications of Satisfiability Testing
• scientific article; zbMATH DE number 69384 (Why is no real title available?)
• scientific article; zbMATH DE number 1335882 (Why is no real title available?)
• An exactly solvable random satisfiability problem
• A probabilistic study on the satisfiability problem
• A probabilistic analysis of randomly generated binary constraint satisfaction problems.
• Refinement-oriented probability for CSP
• Probabilistic approach to the satisfiability problem
• scientific article; zbMATH DE number 3909744 (Why is no real title available?)
• Probabilistic solution of Yao's millionaires' problem

Describes a project that uses

Uses Software

• SATO
• Velev SAT Benchmarks

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