Regular random \(k\)-SAT: Properties of balanced formulas
type: Item
instance of: scholarly article
title: Regular random \(k\)-SAT: Properties of balanced formulas
zbMATH Open document ID: 1109.68100
author: Yacine Boufkhad
author: Olivier Dubois
author: Yannet Interian
author: Bart Selman
published in: Journal of Automated Reasoning
publication date: 2007-01-24T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5118128
zbMATH Keywords: greedy algorithm
MaRDI profile type: Publication
full work available at URL: s10817-005-9012-z
OpenAlex ID: W1987851683
cites work: Lower bounds for random 3-SAT via differential equations
cites work: The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘)
cites work: Q4228436
cites work: Many hard examples for resolution
cites work: Q4828949
cites work: Upper bounds on the satisfiability threshold
cites work: A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae
cites work: Q4952608
cites work: The Forwarding Indices of Random Graphs
cites work: Sharp thresholds of graph properties, and the $k$-sat problem
cites work: A threshold for unsatisfiability
cites work: Q4411392
cites work: Selecting Complementary Pairs of Literals
cites work: Balance and filtering in structured satisfiable problems. (Preliminary report)
cites work: Approximating the unsatisfiability threshold of random formulas
cites work: Differential equations for random processes and random graphs
DOI: 10.1007/S10817-005-9012-Z
description: scientific article; zbMATH DE number 5118128