Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.68207OpenAlexW2494235144MaRDI QIDQ5325862FDOQ5325862

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

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited In (11)

• Probabilistic solution of Yao's millionaires' problem
• Title not available (Why is that?)
• An exactly solvable random satisfiability problem
• A probabilistic study on the satisfiability problem
• Refinement-oriented probability for CSP
• Theory and Applications of Satisfiability Testing
• Title not available (Why is that?)
• Probabilistic approach to the satisfiability problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• A probabilistic analysis of randomly generated binary constraint satisfaction problems.

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)