Random 3-SAT and BDDs: The plot thickens further

DOI10.1007/3-540-45578-7_9MaRDI QIDQ4475626zbMATH OpenFDO

Authors Alfonso San Miguel Aguirre, Moshe Y. Vardi

Publication date 9 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2239/22390121.htm

Mathematics Subject Classification ID

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

Recommendations

• Random 3-SAT: The plot thickens
• Random 3-SAT: The plot thickens
• Hard random 3-SAT problems and the Davis-Putnam procedure
• Some notes on random satisfiability
• scientific article; zbMATH DE number 1113991

Cited in

(8)

• Random 3-SAT: The plot thickens
• ProCount: weighted projected model counting with graded project-join trees
• Implementing semantic merging operators using binary decision diagrams
• On the typical case complexity of graph optimization
• Random 3-SAT: The plot thickens
• ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES
• On limits of symbolic approach to SAT solving
• Symbolic techniques in satisfiability solving

Describes a project that uses

Uses Software

• CUDD

This page was built for publication: Random 3-SAT and BDDs: The plot thickens further

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4475626)