New methods for 3-SAT decision and worst-case analysis
type: Item
instance of: scholarly article
title: New methods for 3-SAT decision and worst-case analysis
zbMATH Open document ID: 0930.68066
DOI: 10.1016/S0304-3975(98)00017-6
author: Oliver Kullmann
published in: Theoretical Computer Science
publication date: 2000-01-12T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1387335
zbMATH Keywords: 3-SAT
zbMATH Keywords: worst-case upper bounds
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: extended resolution
zbMATH Keywords: blocked clauses
zbMATH Keywords: generalized autarkness
describes a project that uses: DIMACS
MaRDI profile type: Publication
cites work: Q4252729
cites work: Two systems for proving tautologies, based on the split method
cites work: A machine program for theorem-proving
cites work: A Computing Procedure for Quantification Theory
cites work: Q4371411
cites work: A satisfiability tester for non-clausal propositional calculus
cites work: Q5687274
cites work: Q4375757
cites work: Q4250220
cites work: Branching rules for satisfiability
cites work: Power indices and easier hard problems
cites work: Q4856172
cites work: On a generalization of extended resolution
cites work: Q4375761
cites work: Q3721816
cites work: Solving satisfiability in less than \(2^ n\) steps
cites work: Q3221403
cites work: Solving Satisfiability with Less Searching
cites work: Q4283247
cites work: Q5593816
cites work: Number of models and satisfiability of sets of clauses
full work available at URL: s0304-3975(98)00017-6
OpenAlex ID: W2066749637
Recommended article: Q4375761
Recommended article: Q5305561
Recommended article: New upper bound for the \#3-SAT problem
Recommended article: A new upper bound for 3-SAT
Recommended article: A new bound for 3-satisfiable MaxSat and its algorithmic application
Recommended article: A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application
Recommended article: Improved Randomized Algorithms for 3-SAT
Recommended article: An efficient algorithm for the 3-satisfiability problem
Recommended article: Q5501274
Recommended article: Q4736839
description: scientific article; zbMATH DE number 1387335