The probability of pure literals

DOI10.1093/logcom/9.4.501zbMath0935.68050OpenAlexW2089667959MaRDI QIDQ4700097

John W. Rosenthal, J. M. Plotkin, John V. Franco

Publication date: 31 October 1999

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0886c59281df0fe9c54df6e87e9addd17e54a2b4

zbMATH Keywords

satisfiability problem\(k\)-SAT

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35) Classical propositional logic (03B05)

Related Items (3)

The expected complexity of analytic tableaux analyses in propositional calculus. II ⋮ An efficient approach to solving random \(k\)-SAT problems ⋮ Pruning processes and a new characterization of convex geometries

This page was built for publication: The probability of pure literals