An improved generator for 3-CNF formulas

DOI10.1134/S0005117920010117zbMath1497.68455OpenAlexW3008398386MaRDI QIDQ827897

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The probabilistic analysis of a greedy satisfiability algorithm

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