On good algorithms for determining unsatisfiability of propositional formulas
type: Item
instance of: scholarly article
title: On good algorithms for determining unsatisfiability of propositional formulas
zbMATH Open document ID: 1029.68077
DOI: 10.1016/S0166-218X(02)00401-8
author: R. Swaminathan
author: John V. Franco
published in: Discrete Applied Mathematics
publication date: 2003-09-15T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1981504
zbMATH Keywords: Satisfiability
zbMATH Keywords: Resolution
zbMATH Keywords: Theorem proving
zbMATH Keywords: Hitting set
MaRDI profile type: Publication
cites work: Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)
cites work: Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem
cites work: Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem
cites work: Q4228436
cites work: Many hard examples for resolution
cites work: A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae
cites work: Q4952608
cites work: On Random 3-sat
cites work: A threshold of ln n for approximating set cover
cites work: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
cites work: Analysis of Two Simple Heuristics on a Random Instance ofk-sat
cites work: Q4198056
cites work: Bounding the unsatisfiability threshold of random 3-SAT
cites work: Tail bounds for occupancy and the satisfiability threshold conjecture
cites work: Approximating the unsatisfiability threshold of random formulas
cites work: On the hardness of approximating minimization problems
full work available at URL: s0166-218x(02)00401-8
OpenAlex ID: W2019983117
description: scientific article; zbMATH DE number 1981504