Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.68198OpenAlexW2494235144MaRDI QIDQ5325851FDOQ5325851

Authors: Youichi Hanatani, Takashi Horiyama, Kazuo Iwama 

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

• Density condensation of Boolean formulas
• An improved generator for 3-CNF formulas
• scientific article; zbMATH DE number 1947423
• Generating hard satisfiability problems
• A numerical approach to 3-SAT

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

• Density condensation of Boolean formulas

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