On the satisfaction probability of k-CNF formulas

DOI10.4230/LIPICS.CCC.2022.2MaRDI QIDQ6568341FDOQ6568341

Authors: Till Tantau 

Publication date: 5 July 2024

zbMATH Keywords

kernelizationlocalitywell orderingsmajority \{k\}-SATsatisfaction probability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: On the satisfaction probability of \(k\)-CNF formulas

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