An improved generator for 3-CNF formulas

DOI10.1134/S0005117920010117MaRDI QIDQ827897zbMATH OpenOpenAlexFDO

Authors S. I. Uvarov

Publication date 14 January 2021

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0005117920010117

zbMATH Keywords

clauseBoolean variablesconjunctive normal form (CNF)satisfiability problem (SAT)

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Computational aspects of satisfiability (68R07)

Recommendations

• scientific article; zbMATH DE number 2083805
• scientific article; zbMATH DE number 2010170
• Generating hard satisfiability problems
• On the satisfiability threshold of formulas with three literals per clause
• scientific article; zbMATH DE number 2159650

Cites work

• scientific article; zbMATH DE number 1113991 (Why is no real title available?)
• scientific article; zbMATH DE number 1775444 (Why is no real title available?)
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• The probabilistic analysis of a greedy satisfiability algorithm

Cited in

(6)

• scientific article; zbMATH DE number 2010170 (Why is no real title available?)
• Some pitfalls for experimenters with random SAT
• An efficient algorithm for 3NF determination
• Density condensation of Boolean formulas
• Theory and Applications of Satisfiability Testing
• Generating clause sequences of a CNF formula

This page was built for publication: An improved generator for 3-CNF formulas

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