An improved generator for 3-CNF formulas

DOI10.1134/S0005117920010117zbMATH Open1497.68455OpenAlexW3008398386MaRDI QIDQ827897FDOQ827897

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The probabilistic analysis of a greedy satisfiability algorithm
• Title not available (Why is that?)

Cited In (6)

• Generating clause sequences of a CNF formula
• Title not available (Why is that?)
• An efficient algorithm for 3NF determination
• Density condensation of Boolean formulas
• Some pitfalls for experimenters with random SAT
• Theory and Applications of Satisfiability Testing

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)