Login / Signup
Approximating the Unsatisfiability Threshold of Random Formulas (Extended Abstract).
Lefteris M. Kirousis
Evangelos Kranakis
Danny Krizanc
Published in:
ESA (1996)
Keyphrases
</>
extended abstract
propositional formulas
cnf formula
threshold selection
database systems
upper bound
orders of magnitude
propositional logic
uniformly distributed
genetic algorithm
case study
randomly generated
max sat
random sat